Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming

DOI10.17516/1997-1397-2018-11-3-300-312MaRDI QIDQ5853250zbMATH OpenOpenAlexWikidataFDO

Authors B. Merikhi, Djamel Benterki, Assma Leulmi

Publication date 18 March 2021

Published in Journal of Siberian Federal University. Mathematics & Physics (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/jsfu674

zbMATH Keywords

interior-point methodsline searchlogarithmic barrier methodssemidefinite programming

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Recommendations

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

Cites work

• A logarithm barrier method for semi-definite programming
• A numerical feasible interior point method for linear semidefinite programs
• A relaxed logarithmic barrier method for semidefinite programming
• Bounds for eigenvalues using traces
• Convex Analysis
• New bounds for the extreme values of a finite sample of real numbers
• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• Some new search directions for primal-dual interior point methods in semidefinite programming

Cited in

(12)

• 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
• scientific article; zbMATH DE number 7473683 (Why is no real title available?)
• Adaptation of the minorant function for linear programming
• On the New Barrier Function and Specialized Algorithms for a Class of Semidefinite Programs
• 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

This page was built for publication: Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming

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