# Florian Jarre

According to our database

Collaborative distances:

^{1}, Florian Jarre authored at least 37 papers between 1991 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting.

J. Global Optimization, 2020

2018

The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction.

Optimization Methods and Software, 2018

2016

Improved Metabolic Models for E. coli and Mycoplasma genitalium from GlobalFit, an Algorithm That Simultaneously Matches Growth and Non-Growth Data Sets.

PLoS Computational Biology, 2016

Simple examples for the failure of Newton's method with line search for strictly convex minimization.

Math. Program., 2016

2015

Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques.

Comp. Opt. and Appl., 2015

CycleFreeFlux: efficient removal of thermodynamically infeasible loops from flux distributions.

Bioinform., 2015

2014

A Symmetric Reduction of the NT Direction.

SIAM J. Optim., 2014

On the stable solution of large scale problems over the doubly nonnegative cone.

Math. Program., 2014

2013

On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix.

SIAM J. Matrix Anal. Appl., 2013

On Nesterov's smooth Chebyshev-Rosenbrock function.

Optimization Methods and Software, 2013

2012

High-accuracy solution of large-scale semidefinite programs.

Optimization Methods and Software, 2012

Burer's key assumption for semidefinite and doubly nonnegative relaxations.

Optim. Lett., 2012

2011

Quadratic factorization heuristics for copositive programming.

Math. Program. Comput., 2011

A self-concordance property for nonconvex semidefinite programming.

Math. Methods Oper. Res., 2011

2010

A note on Burer's copositive representation of mixed-binary QPs.

Optim. Lett., 2010

2009

On the time synchronization of distributed log files in networks with local broadcast media.

IEEE/ACM Trans. Netw., 2009

On the computation of

*C** certificates.
J. Global Optimization, 2009

2008

An Augmented Primal-Dual Method for Linear Conic Programs.

SIAM J. Optim., 2008

2007

Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling.

Math. Program., 2007

2006

Loss of Superlinear Convergence for an SQP-Type Method with Conic Constraints.

SIAM J. Optim., 2006

2004

A sensitivity result for semidefinite programs.

Oper. Res. Lett., 2004

Preface.

Optimization Methods and Software, 2004

An extension of the positive real lemma to descriptor systems.

Optimization Methods and Software, 2004

2001

Solving the Sum-of-Ratios Problem by an Interior-Point Method.

J. Global Optimization, 2001

Some Aspects of Nonlinear Semidefinite Programming.

Proceedings of the System Modelling and Optimization XX, 2001

1999

The role of linear objective functions in barrier methods.

Math. Program., 1999

Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.

Math. Program., 1999

Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs.

Math. Oper. Res., 1999

1998

A QQP-Minimization Method for Semidefinite and Smooth Nonconvex Programs

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

Optimal Truss Design by Interior-Point Methods.

SIAM J. Optim., 1998

1996

On self-concordant barrier functions for conic hulls and fractional programming.

Math. Program., 1996

A QMR-based interior-point algorithm for solving linear programs.

Math. Program., 1996

An infeasible-interior-point algorithm using projections onto a convex set.

Annals OR, 1996

1995

A Practical Interior-Point Method for Convex Programming.

SIAM J. Optim., 1995

A sufficient condition for self-concordance, with application to some classes of structured convex programming problems.

Math. Program., 1995

1994

An interior-point method for fractional programs with convex constraints.

Math. Program., 1994

1991

On the convergence of the method of analytic centers when applied to convex quadratic programs.

Math. Program., 1991