A logarithm barrier method for semi-definite programming
From MaRDI portal
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
- A numerical feasible interior point method for linear semidefinite programs
- Bounds for eigenvalues using traces
- Convex Analysis
- Foreword to: Semidefinite programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- New bounds for the extreme values of a finite sample of real numbers
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Semidefinite Programming
Cited in
(22)- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
- 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
- Two logarithmic barrier methods for convex semi-infinite problems.
- A feasible primal-dual interior point method for linear semidefinite programming
- A logarithmic barrier approach for linear programming
- A new barrier for a class of semidefinite problems
- scientific article; zbMATH DE number 1091399 (Why is no real title available?)
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial
- Adaptation of the minorant function for linear programming
- On the New Barrier Function and Specialized Algorithms for a Class of Semidefinite Programs
- A relaxed logarithmic barrier method for semidefinite programming
- Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
- Logarithmic Barrier Method Via Minorant Function for Linear Programming
- An efficient logarithmic barrier method without line search for convex quadratic programming
- 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
- A Newton descent logarithmic barrier interior-point algorithm for monotone LCP
- Theoretical and numerical results for nonlinear optimization problems
- Penalty and barrier methods for convex semidefinite programming
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)
