A logarithm barrier method for semi-definite programming
From MaRDI portal
Publication:3539804
DOI10.1051/RO:2008005zbMATH Open1211.90158OpenAlexW1979740631MaRDI QIDQ3539804FDOQ3539804
Authors: J.-P. Crouzeix, B. Merikhi 
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
Recommendations
- scientific article; zbMATH DE number 1091399
- Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
- A relaxed logarithmic barrier method for semidefinite programming
- scientific article; zbMATH DE number 554512
- scientific article; zbMATH DE number 708836
- A logarithm barrier method for linear programming
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- A logarithmic barrier approach and its regularization applied to convex semi-finite programming problems.
- A logarithmic barrier approach for linear programming
- Logarithmic barrier method via minorant function for linear semidefinite programming
Cites Work
- Semidefinite Programming
- Convex Analysis
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Bounds for eigenvalues using traces
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- New bounds for the extreme values of a finite sample of real numbers
- A numerical feasible interior point method for linear semidefinite programs
- Foreword to: Semidefinite programming
Cited In (20)
- An efficient logarithmic barrier method without line search for convex quadratic programming
- A relaxed logarithmic barrier method for semidefinite programming
- A new barrier for a class of semidefinite problems
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- Adaptation of the minorant function for linear programming
- Two logarithmic barrier methods for convex semi-infinite problems.
- A primal-dual interior-point method based on various selections of displacement step for symmetric optimization
- Penalty and barrier methods for convex semidefinite programming
- Logarithmic Barrier Method Via Minorant Function for Linear Programming
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial
- A feasible primal-dual interior point method for linear semidefinite programming
- A logarithmic barrier approach for linear programming
- On the New Barrier Function and Specialized Algorithms for a Class of Semidefinite Programs
- A novel adaptive method based on new minorant-majorant functions without line search for semidefinite optimization
- Study of a penalty method for nonlinear optimization based on a new approximate function
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
- Logarithmic barrier method via minorant function for linear semidefinite programming
- A Newton descent logarithmic barrier interior-point algorithm for monotone LCP
- Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
Uses Software
This page was built for publication: A logarithm barrier method for semi-definite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3539804)
