A relaxed logarithmic barrier method for semidefinite programming

DOI10.1051/RO/2014055MaRDI QIDQ5501874zbMATH OpenOpenAlexFDO

Authors Kettab Samia, Benterki Djamel

Publication date 14 August 2015

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2014055

zbMATH Keywords

central trajectory methodslinear programmingsemidefinite programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Recommendations

• A logarithm barrier method for semi-definite programming
• scientific article; zbMATH DE number 1091399
• Logarithmic barrier method via minorant function for linear semidefinite programming
• A new primal-dual interior-point algorithm for semidefinite optimization
• A primal interior point method for the linear semidefinite programming problem

Cites work

• A New Notion of Weighted Centers for Semidefinite Programming
• A new polynomial-time algorithm for linear programming
• A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming
• A numerical feasible interior point method for linear semidefinite programs
• A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
• An Interior-Point Method for Semidefinite Programming
• Condition-measure bounds on the behavior of the central trajectory of a semidefinite program
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Nonsymmetric Search Directions for Semidefinite Programming
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• On the Convergence of the Central Path in Semidefinite Optimization
• On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
• On the Nesterov--Todd Direction in Semidefinite Programming
• Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming
• Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• Semidefinite optimization
• Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
• Some new search directions for primal-dual interior point methods in semidefinite programming

Cited in

(10)

• An interior-point algorithm for semidefinite least-squares problems.
• 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 logarithm barrier method for semi-definite programming
• A new barrier for a class of semidefinite problems
• On the New Barrier Function and Specialized Algorithms for a Class of Semidefinite Programs
• Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
• A novel adaptive method based on new minorant-majorant functions without line search for semidefinite optimization
• IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming

This page was built for publication: A relaxed logarithmic barrier method for semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501874)