# Florian Jarre

According to our database

Collaborative distances:

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

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Optim. Methods Softw., 2020

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

J. Glob. Optim., 2020

2018

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

Optim. Methods Softw., 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 Comput. Biol., 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.

Comput. Optim. Appl., 2015

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

Bioinform., 2015

2014

SIAM J. Optim., 2014

Math. Program., 2014

2013

SIAM J. Matrix Anal. Appl., 2013

Optim. Methods Softw., 2013

2012

Optim. Methods Softw., 2012

Optim. Lett., 2012

2011

Math. Program. Comput., 2011

Math. Methods Oper. Res., 2011

2010

Optim. Lett., 2010

2009

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

IEEE/ACM Trans. Netw., 2009

J. Glob. Optim., 2009

2008

SIAM J. Optim., 2008

2007

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

Math. Program., 2007

2006

SIAM J. Optim., 2006

2004

Oper. Res. Lett., 2004

Optim. Methods Softw., 2004

Optim. Methods Softw., 2004

2001

J. Glob. Optim., 2001

Some Aspects of Nonlinear Semidefinite Programming.

Proceedings of the System Modelling and Optimization XX, 2001

1999

Math. Program., 1999

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

Math. Program., 1999

Math. Oper. Res., 1999

1998

A QQP-Minimization Method for Semidefinite and Smooth Nonconvex Programs

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

SIAM J. Optim., 1998

1996

Math. Program., 1996

Math. Program., 1996

Ann. Oper. Res., 1996

1995

SIAM J. Optim., 1995

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

Math. Program., 1995

1994

Math. Program., 1994

1991

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

Math. Program., 1991