A logarithmic barrier interior-point method based on majorant functions for second-order cone programming

DOI10.1007/s11590-019-01404-1zbMath1442.90177OpenAlexW2917756268WikidataQ128388528 ScholiaQ128388528MaRDI QIDQ2174912

Baha M. Alzalg

Publication date: 27 April 2020

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-019-01404-1

zbMATH Keywords

interior-point methodsJordan algebrassecond order cone programminglogarithmic barrier methodsmajorant functions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items (2)

An interior-point algorithm for semidefinite least-squares problems. ⋮ On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization

Uses Software

• Mosek

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A feasible primal-dual interior point method for linear semidefinite programming
• A logarithmic barrier approach for linear programming
• A power penalty method for second-order cone nonlinear complementarity problems
• A smoothing Newton method for second-order cone optimization based on a new smoothing function
• A smoothing-type Newton method for second-order cone programming problems based on a new smooth function
• A new one-step smoothing Newton method for second-order cone programming.
• An extended variant of Karmarkar's interior point algorithm
• A one-step smoothing Newton method for second-order cone programming
• Extension of a projective interior point method for linearly constrained convex programming
• Bounds for eigenvalues using traces
• Extension of primal-dual interior point algorithms to symmetric cones
• Second-order cone programming
• Interior point methods for second-order cone programming and OR applications
• A globally and quadratically convergent smoothing Newton method for solving second-order cone optimization
• A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems
• An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming
• A corrector–predictor path-following method for second-order cone optimization
• A logarithm barrier method for semi-definite programming
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• Primal-dual path-following algorithms for circular programming
• Elliptic cone optimization and primal–dual path-following algorithms
• A numerical feasible interior point method for linear semidefinite programs

This page was built for publication: A logarithmic barrier interior-point method based on majorant functions for second-order cone programming