A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems

DOI10.1137/0806016zbMATH Open0858.65053OpenAlexW2030920307MaRDI QIDQ4884037FDOQ4884037

Authors: Aaron Melman 

Publication date: 25 March 1997

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0806016

Recommendations

• A new linesearch method for quadratically constrained convex programming
• Line Search Procedures for the Logarithmic Barrier Function
• Line Search Techniques for the Logarithmic Barrier Function in Quadratic Programming
• A long-step barrier method for convex quadratic programming
• Complexity analysis for certain convex programming problems

zbMATH Keywords

eigenvaluesconvex programmingbisection methodline searchsuperlinear convergencebarrier methodsstepsize problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cited In (6)

• Majorize-minimize linesearch for inversion methods involving barrier function optimization
• Line Search Techniques for the Logarithmic Barrier Function in Quadratic Programming
• A new linesearch method for quadratically constrained convex programming
• Line Search Procedures for the Logarithmic Barrier Function
• Title not available (Why is that?)
• Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method

This page was built for publication: A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems

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