Florian Jarre

From MaRDI portal
Person:235035

Available identifiers

zbMath Open jarre.florianMaRDI QIDQ235035

List of research outcomes





PublicationDate of PublicationType
Optimized convergence of stochastic gradient descent by weighted averaging2024-11-20Paper
Iteration complexity of fixed-step methods by Nesterov and Polyak for convex quadratic functions2024-09-02Paper
https://portal.mardi4nfdi.de/entity/Q60761522023-10-23Paper
Iteration Complexity of Fixed-Step Methods by Nesterov and Polyak for Convex Quadratic Functions2022-11-18Paper
Optimized convergence of stochastic gradient descent by weighted averaging2022-09-28Paper
On the existence of affine invariant descent directions2021-04-15Paper
Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting2020-03-25Paper
Optimization. Introduction to mathematical theory and methods2019-04-11Paper
The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction2018-05-02Paper
Calibration by optimization without using derivatives2017-06-21Paper
Simple examples for the failure of Newton's method with line search for strictly convex minimization2016-08-25Paper
Elementary Optimality Conditions for Nonlinear SDPs2016-04-26Paper
Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques2015-09-04Paper
New results on the cp-rank and related properties of co(mpletely )positive matrices2015-01-14Paper
A Symmetric Reduction of the NT Direction2014-09-26Paper
On the stable solution of large scale problems over the doubly nonnegative cone2014-08-29Paper
Least squares timestamp synchronization for local broadcast networks2013-10-24Paper
On the cp-rank and minimal cp factorizations of a completely positive matrix2013-09-26Paper
On Nesterov's smooth Chebyshev–Rosenbrock function2013-06-24Paper
Burer's key assumption for semidefinite and doubly nonnegative relaxations2012-11-30Paper
High-accuracy solution of large-scale semidefinite programs2012-11-06Paper
A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm2012-08-08Paper
A self-concordance property for nonconvex semidefinite programming2011-09-20Paper
Quadratic factorization heuristics for copositive programming2011-06-08Paper
A note on Burer's copositive representation of mixed-binary QPs2010-10-04Paper
On the computation of \(C^*\) certificates2009-11-16Paper
An Augmented Primal-Dual Method for Linear Conic Programs2009-05-27Paper
https://portal.mardi4nfdi.de/entity/Q54424852008-02-22Paper
Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling2007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q34157532007-01-19Paper
Loss of Superlinear Convergence for an SQP-Type Method with Conic Constraints2006-05-30Paper
An extension of the positive real lemma to descriptor systems2005-04-29Paper
https://portal.mardi4nfdi.de/entity/Q48172642004-09-22Paper
A sensitivity result for semidefinite programs.2004-01-05Paper
Optimization2003-09-09Paper
An interior method for nonconvex semidefinite programs2003-03-12Paper
Optimal design of trusses under a nonconvex global buckling constraint2002-03-14Paper
Convergence of a class of inexact interior-point algorithms for linear programs2001-11-26Paper
Solving the sum-of-ratios problem by an interior-point method2001-02-18Paper
https://portal.mardi4nfdi.de/entity/Q45171142000-11-23Paper
https://portal.mardi4nfdi.de/entity/Q45170972000-11-22Paper
Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.2000-07-21Paper
The role of linear objective functions in barrier methods2000-07-21Paper
https://portal.mardi4nfdi.de/entity/Q42534671999-08-09Paper
Optimal Truss Design by Interior-Point Methods1999-02-22Paper
https://portal.mardi4nfdi.de/entity/Q43478471997-12-01Paper
A QMR-based interior-point algorithm for solving linear programs1997-07-23Paper
On self-concordant barrier functions for conic hulls and fractional programming1997-02-03Paper
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems1996-09-18Paper
An infeasible-interior-point algorithm using projections onto a convex set1996-07-01Paper
A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems1996-06-02Paper
A Practical Interior-Point Method for Convex Programming1995-11-30Paper
An interior-point method for multifractional programs with convex constraints1995-07-03Paper
An interior-point method for fractional programs with convex constraints1995-05-15Paper
A new line-search step based on the Weierstrass \(\wp\)-function for minimizing a class of logarithmic barrier functions1994-11-21Paper
Minisymposium 2 : Optimierung1994-09-21Paper
Optimal ellipsoidal approximations around the analytic center1994-08-10Paper
An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices1994-01-23Paper
Interior-point methods for convex programming1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q39957061992-09-17Paper
On the convergence of the method of analytic centers when applied to convex quadratic programs1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52028501990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47350391989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47296151989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38277971988-01-01Paper

Research outcomes over time

This page was built for person: Florian Jarre