The following pages link to Florian Jarre (Q235035):
Displaying 50 items.
- Simple examples for the failure of Newton's method with line search for strictly convex minimization (Q304219) (← links)
- Least squares timestamp synchronization for local broadcast networks (Q374664) (← links)
- On the stable solution of large scale problems over the doubly nonnegative cone (Q403648) (← links)
- A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm (Q441797) (← links)
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691) (← links)
- Quadratic factorization heuristics for copositive programming (Q542052) (← links)
- A self-concordance property for nonconvex semidefinite programming (Q639360) (← links)
- Burer's key assumption for semidefinite and doubly nonnegative relaxations (Q691396) (← links)
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling (Q868464) (← links)
- On the computation of \(C^*\) certificates (Q1037359) (← links)
- Interior-point methods for convex programming (Q1205507) (← links)
- (Q1330920) (redirect page) (← links)
- Optimal ellipsoidal approximations around the analytic center (Q1330921) (← links)
- A new line-search step based on the Weierstrass \(\wp\)-function for minimizing a class of logarithmic barrier functions (Q1338825) (← links)
- A QMR-based interior-point algorithm for solving linear programs (Q1361110) (← links)
- A sensitivity result for semidefinite programs. (Q1417590) (← links)
- Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. (Q1572663) (← links)
- The role of linear objective functions in barrier methods (Q1572683) (← links)
- Solving the sum-of-ratios problem by an interior-point method (Q1595900) (← links)
- Optimization. Introduction to mathematical theory and methods (Q1738350) (← links)
- An interior-point method for fractional programs with convex constraints (Q1804653) (← links)
- On self-concordant barrier functions for conic hulls and fractional programming (Q1814792) (← links)
- An interior method for nonconvex semidefinite programs (Q1863841) (← links)
- An interior-point method for multifractional programs with convex constraints (Q1893345) (← links)
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems (Q1913863) (← links)
- An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems (Q1922691) (← links)
- A note on Burer's copositive representation of mixed-binary QPs (Q1958650) (← links)
- On the convergence of the method of analytic centers when applied to convex quadratic programs (Q2277366) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- Calibration by optimization without using derivatives (Q2358082) (← links)
- Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs (Q2757582) (← links)
- Elementary Optimality Conditions for Nonlinear SDPs (Q2802534) (← links)
- On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix (Q2848616) (← links)
- New results on the cp-rank and related properties of co(mpletely )positive matrices (Q2938346) (← links)
- An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices (Q3141559) (← links)
- A Symmetric Reduction of the NT Direction (Q3192101) (← links)
- (Q3415753) (← links)
- An Augmented Primal-Dual Method for Linear Conic Programs (Q3629521) (← links)
- (Q3827797) (← links)
- (Q3995706) (← links)
- Optimal Truss Design by Interior-Point Methods (Q4229464) (← links)
- (Q4253467) (← links)
- Minisymposium 2 : Optimierung (Q4306791) (← links)
- (Q4347847) (← links)
- (Q4517097) (← links)
- (Q4517114) (← links)
- The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction (Q4638912) (← links)
- An extension of the positive real lemma to descriptor systems (Q4673324) (← links)
- (Q4729615) (← links)
