default search action
Florian Jarre
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j38]Tibor Illés, Florian Jarre, Etienne de Klerk, Goran Lesaja
:
Conic Optimization and Interior Point Methods: Theory, Computations, and Applications. J. Optim. Theory Appl. 202(1): 1-10 (2024) - [j37]Melinda Hagedorn
Iteration Complexity of Fixed-Step Methods by Nesterov and Polyak for Convex Quadratic Functions. J. Optim. Theory Appl. 202(1): 456-474 (2024) - 2020
- [j36]Florian Jarre
Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting. J. Glob. Optim. 76(4): 913-932 (2020) - [j35]Yu-Hong Dai, Florian Jarre, Felix Lieder:
On the existence of affine invariant descent directions. Optim. Methods Softw. 35(5): 938-954 (2020)
2010 – 2019
- 2018
- [j34]Florian Jarre, Felix Lieder:
The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction. Optim. Methods Softw. 33(1): 70-91 (2018) - 2016
- [j33]Florian Jarre, Philippe L. Toint
Simple examples for the failure of Newton's method with line search for strictly convex minimization. Math. Program. 158(1-2): 23-34 (2016) - [j32]Daniel Hartleb, Florian Jarre, Martin J. Lercher
Improved Metabolic Models for E. coli and Mycoplasma genitalium from GlobalFit, an Algorithm That Simultaneously Matches Growth and Non-Growth Data Sets. PLoS Comput. Biol. 12(8) (2016) - 2015
- [j31]Abdelmoneim Amer Desouki
CycleFreeFlux: efficient removal of thermodynamically infeasible loops from flux distributions. Bioinform. 31(13): 2159-2165 (2015) - [j30]Felix Lieder, Fatemeh Bani Asadi Rad, Florian Jarre:
Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques. Comput. Optim. Appl. 61(3): 669-688 (2015) - 2014
- [j29]Thomas Davi, Florian Jarre:
On the stable solution of large scale problems over the doubly nonnegative cone. Math. Program. 146(1-2): 299-323 (2014) - [j28]Florian Jarre, Chantal Hergenroeder:
A Symmetric Reduction of the NT Direction. SIAM J. Optim. 24(2): 714-732 (2014) - 2013
- [j27]Florian Jarre:
On Nesterov's smooth Chebyshev-Rosenbrock function. Optim. Methods Softw. 28(3): 478-484 (2013) - [j26]Naomi Shaked-Monderer
On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix. SIAM J. Matrix Anal. Appl. 34(2): 355-368 (2013) - 2012
- [j25]Florian Jarre:
Burer's key assumption for semidefinite and doubly nonnegative relaxations. Optim. Lett. 6(3): 593-599 (2012) - [j24]Thomas Davi, Florian Jarre:
High-accuracy solution of large-scale semidefinite programs. Optim. Methods Softw. 27(4-5): 655-666 (2012) - 2011
- [j23]Rodrigo Garcés, Walter Gómez
A self-concordance property for nonconvex semidefinite programming. Math. Methods Oper. Res. 74(1): 77-92 (2011) - [j22]Immanuel M. Bomze
Quadratic factorization heuristics for copositive programming. Math. Program. Comput. 3(1): 37-57 (2011) - 2010
- [j21]Immanuel M. Bomze
A note on Burer's copositive representation of mixed-binary QPs. Optim. Lett. 4(3): 465-472 (2010)
2000 – 2009
- 2009
- [j20]Florian Jarre, Katrin Schmallowsky:
On the computation of C* certificates. J. Glob. Optim. 45(2): 281-296 (2009) - [j19]Björn Scheuermann, Wolfgang Kiess, Magnus Roos, Florian Jarre, Martin Mauve:
On the time synchronization of distributed log files in networks with local broadcast media. IEEE/ACM Trans. Netw. 17(2): 431-444 (2009) - 2008
- [j18]Florian Jarre, Franz Rendl:
An Augmented Primal-Dual Method for Linear Conic Programs. SIAM J. Optim. 19(2): 808-823 (2008) - 2007
- [j17]Roland W. Freund, Florian Jarre, Christoph H. Vogelbusch:
Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling. Math. Program. 109(2-3): 581-611 (2007) - 2006
- [j16]Moritz Diehl, Florian Jarre, Christoph H. Vogelbusch:
Loss of Superlinear Convergence for an SQP-Type Method with Conic Constraints. SIAM J. Optim. 16(4): 1201-1210 (2006) - 2004
- [j15]Florian Jarre, Michal Kocvara:
Preface. Optim. Methods Softw. 19(1): 1-2 (2004) - [j14]Roland W. Freund, Florian Jarre:
An extension of the positive real lemma to descriptor systems. Optim. Methods Softw. 19(1): 69-87 (2004) - [j13]Roland W. Freund, Florian Jarre:
A sensitivity result for semidefinite programs. Oper. Res. Lett. 32(2): 126-132 (2004) - 2001
- [j12]Roland W. Freund, Florian Jarre:
Solving the Sum-of-Ratios Problem by an Interior-Point Method. J. Glob. Optim. 19(1): 83-102 (2001) - [c1]Florian Jarre:
Some Aspects of Nonlinear Semidefinite Programming. System Modelling and Optimization 2001: 55-69
1990 – 1999
- 1999
- [j11]Roland W. Freund, Florian Jarre, Shinji Mizuno:
Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs. Math. Oper. Res. 24(1): 50-71 (1999) - [j10]Shinji Mizuno, Florian Jarre:
Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. Math. Program. 84(1): 105-122 (1999) - [j9]Stephen J. Wright, Florian Jarre:
The role of linear objective functions in barrier methods. Math. Program. 84(2): 357-373 (1999) - 1998
- [j8]Florian Jarre, Michal Kocvara
Optimal Truss Design by Interior-Point Methods. SIAM J. Optim. 8(4): 1084-1107 (1998) - [i1]Florian Jarre:
A QQP-Minimization Method for Semidefinite and Smooth Nonconvex Programs. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-12 (1998) - 1996
- [j7]Shinji Mizuno, Florian Jarre:
An infeasible-interior-point algorithm using projections onto a convex set. Ann. Oper. Res. 62(1): 59-80 (1996) - [j6]Roland W. Freund, Florian Jarre, Siegfried Schaible:
On self-concordant barrier functions for conic hulls and fractional programming. Math. Program. 74: 237-246 (1996) - [j5]Roland W. Freund, Florian Jarre:
A QMR-based interior-point algorithm for solving linear programs. Math. Program. 76: 183-210 (1996) - 1995
- [j4]Dick den Hertog, Florian Jarre, Kees Roos, Tamás Terlaky
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems. Math. Program. 69: 75-88 (1995) - [j3]Florian Jarre, Michael A. Saunders:
A Practical Interior-Point Method for Convex Programming. SIAM J. Optim. 5(1): 149-171 (1995) - 1994
- [j2]Roland W. Freund, Florian Jarre:
An interior-point method for fractional programs with convex constraints. Math. Program. 67: 407-440 (1994) - 1991
- [j1]Florian Jarre:
On the convergence of the method of analytic centers when applied to convex quadratic programs. Math. Program. 49: 341-358 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: