A logarithm barrier method for semi-definite programming
From MaRDI portal
Publication:3539804
DOI10.1051/ro:2008005zbMath1211.90158OpenAlexW1979740631MaRDI QIDQ3539804
Bachir Merikhi, Jean-Pierre Crouzeix
Publication date: 19 November 2008
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/105393
Related Items (11)
ADAPTATION OF THE MINORANT FUNCTION FOR LINEAR PROGRAMMING ⋮ An efficient logarithmic barrier method without line search for convex quadratic programming ⋮ A feasible primal-dual interior point method for linear semidefinite programming ⋮ A logarithmic barrier approach for linear programming ⋮ A logarithmic barrier interior-point method based on majorant functions for second-order cone programming ⋮ A primal-dual interior-point method based on various selections of displacement step for symmetric optimization ⋮ Logarithmic barrier method via minorant function for linear semidefinite programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming ⋮ Logarithmic Barrier Method Via Minorant Function for Linear Programming
Uses Software
Cites Work
- Bounds for eigenvalues using traces
- Foreword to: Semidefinite programming
- New bounds for the extreme values of a finite sample of real numbers
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- A numerical feasible interior point method for linear semidefinite programs
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
- Convex Analysis
This page was built for publication: A logarithm barrier method for semi-definite programming
