Florian Jarre

发表

An Augmented Primal-Dual Method for Linear Conic Programs

Franz Rendl, Florian Jarre, 2008, SIAM J. Optim..

On Nesterov's smooth Chebyshev–Rosenbrock function

Florian Jarre, F. Jarre, 2013, Optim. Methods Softw..

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

Florian Jarre, Felix Lieder, Fatemeh Bani Asadi Rad, 2015, Comput. Optim. Appl..

High-accuracy solution of large-scale semidefinite programs

Florian Jarre, Thomas Davi, 2012, Optim. Methods Softw..

A sensitivity result for semidefinite programs

Roland W. Freund, Florian Jarre, 2004, Oper. Res. Lett..

On the computation of C* certificates

Florian Jarre, Katrin Schmallowsky, F. Jarre, 2009, J. Glob. Optim..

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

Florian Jarre, Immanuel M. Bomze, Werner Schachinger, 2013, SIAM J. Matrix Anal. Appl..

A Practical Interior-Point Method for Convex Programming

Michael A. Saunders, Florian Jarre, M. Saunders, 1995, SIAM J. Optim..

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

Roland W. Freund, Florian Jarre, Siegfried Schaible, 1996, Math. Program..

An extension of the positive real lemma to descriptor systems

Roland W. Freund, Florian Jarre, F. Jarre, 2004, Optim. Methods Softw..

Interior-Point Methods for Classes of Convex Programs

Florian Jarre, F. Jarre, 1996 .

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

Roland W. Freund, Florian Jarre, F. Jarre, 2001, J. Glob. Optim..

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

Shinji Mizuno, Florian Jarre, S. Mizuno, 1996, Ann. Oper. Res..

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

Florian Jarre, Philippe L. Toint, P. Toint, 2016, Math. Program..

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

Moritz Diehl, Florian Jarre, Christoph H. Vogelbusch, 2006, SIAM J. Optim..

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

Roland W. Freund, Florian Jarre, F. Jarre, 1997, Math. Program..

Optimal Truss Design by Interior-Point Methods

Florian Jarre, Michal Kocvara, Jochem Zowe, 1998, SIAM J. Optim..

CycleFreeFlux: efficient removal of thermodynamically infeasible loops from flux distributions

Florian Jarre, Martin J. Lercher, Gabriel Gelius-Dietrich, 2015, Bioinform..

A sensitivity analysis and a convergence result for a sequential semidefinite programming method

Roland W. Freund, Florian Jarre, F. Jarre, 2003 .

A Symmetric Reduction of the NT Direction

Florian Jarre, Chantal Hergenroeder, F. Jarre, 2014, SIAM J. Optim..

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

Florian Jarre, Tamás Terlaky, Kees Roos, 1995, Math. Program..

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

Florian Jarre, F. Jarre, 1991, Math. Program..

Elementary Optimality Conditions for Nonlinear SDPs

Florian Jarre, 2012 .

Some Aspects of Nonlinear Semidefinite Programming

Florian Jarre, 2001, System Modelling and Optimization.

A QQP-Minimization Method for Semidefinite and Smooth Nonconvex Programs

Florian Jarre, 1998, Universität Trier, Mathematik/Informatik, Forschungsbericht.

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

Florian Jarre, Martin J. Lercher, Daniel Hartleb, 2016, PLoS Comput. Biol..

A self-concordance property for nonconvex semidefinite programming

Florian Jarre, Walter Gómez, Rodrigo Garcés, 2011, Math. Methods Oper. Res..

On the Time Synchronization of Distributed Log Files in Networks With Local Broadcast Media

Martin Mauve, Björn Scheuermann, Florian Jarre, 2009, IEEE/ACM Transactions on Networking.

An interior-point method for fractional programs with convex constraints

Roland W. Freund, Florian Jarre, 1994, Math. Program..

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

Florian Jarre, Thomas Davi, 2014, Math. Program..

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

Ya-Feng Liu, Florian Jarre, Felix Lieder, 2020, J. Glob. Optim..

The role of linear objective functions in barrier methods

Stephen J. Wright, Florian Jarre, F. Jarre, 1999, Math. Program..

Least squares timestamp synchronization for local broadcast networks

Martin Mauve, Florian Jarre, Björn Scheuermann, 2010 .

On the existence of affine invariant descent directions

Florian Jarre, Yu-Hong Dai, Felix Lieder, 2020, Optim. Methods Softw..

Quadratic factorization heuristics for copositive programming

Franz Rendl, Florian Jarre, Immanuel M. Bomze, 2011, Math. Program. Comput..

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

Florian Jarre, Immanuel M. Bomze, 2010, Optim. Lett..

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

Shinji Mizuno, Roland W. Freund, Florian Jarre, 1999, Math. Oper. Res..

Convex Analysis on Symmetric Matrices

Florian Jarre, 2000 .

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

Roland W. Freund, Florian Jarre, Christoph H. Vogelbusch, 2007, Math. Program..

Preface

Michal Kočvara, Florian Jarre, 2004, Optim. Methods Softw..

Burer’s key assumption for semidefinite and doubly nonnegative relaxations

Florian Jarre, 2012, Optim. Lett..

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

Shinji Mizuno, Florian Jarre, S. Mizuno, 1997, Math. Program..

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

Florian Jarre, Felix Lieder, F. Jarre, 2018, Optim. Methods Softw..

Calibration by optimization without using derivatives

Florian Jarre, Markus Lazar, F. Jarre, 2016 .

A sequential semidefinite programming method and an application in passive reduced-order modeling

Roland W. Freund, Florian Jarre, Christoph H. Vogelbusch, 2005, math/0503135.

An adaptive primal-dual method for linear programming

Michael A. Saunders, Florian Jarre, M. Saunders, 1991 .

A Derivative-Free and Ready-to-Use NLP Solver for Matlab or Octave

Florian Jarre, 2017 .

Two theoretical results for sequential semidefinite programming

Florian Jarre, Rodrigo Garcés, Walter Gomez Bofill, 2008 .

Error Bounds and Consistency of Maximum Likelihood Time Synchronization

Martin Mauve, Björn Scheuermann, Florian Jarre, 2008 .

New results on the cp-rank and related properties of co(mpletely )positive matrices

Florian Jarre, Immanuel M. Bomze, Werner Schachinger, 2015 .

A new line-search step based on the Weierstrass $\wp$-function for minimizing a class of logarithmic barrier functions

Florian Jarre, F. Jarre, 1994 .

An Interior-Point Method For Convex Fractional Programming

Roland W. Freund, Florian Jarre, F. Jarre, 1993 .

Relating max-cut problems and binary linear feasibility problems

Florian Jarre, 2009 .