A new linesearch method for quadratically constrained convex programming

DOI10.1016/0167-6377(94)90062-0MaRDI QIDQ1342277zbMATH OpenOpenAlexFDO

Authors Aaron Melman

Publication date 17 January 1996

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(94)90062-0

zbMATH Keywords

improved Newton methodinterior point methodslinesearchquadratic constraintsquadratic objective functionstep optimizationtransformed derivative

Mathematics Subject Classification ID

Quadratic programming (90C20)

Recommendations

• A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems
• An interior Newton method for quadratic programming
• A stable interior point method for convex quadratic programming
• A New Practically Efficient Interior Point Method for Convex Quadratic Programming
• A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming

Cites work

• A New Method for Optimal Truss Topology Design
• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Achievable potential reductions in the method of Kojima et al. in the case of linear programming
• Generation of degenerate linear programming problems
• scientific article; zbMATH DE number 4121759 (Why is no real title available?)
• scientific article; zbMATH DE number 3240705 (Why is no real title available?)
• scientific article; zbMATH DE number 3253619 (Why is no real title available?)
• Line Search Procedures for the Logarithmic Barrier Function
• Modified barrier functions (theory and methods)
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
• The Variable Reduction Method for Nonlinear Programming
• Unified complexity analysis for Newton LP methods

Cited in

(5)

• An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.
• scientific article; zbMATH DE number 17710 (Why is no real title available?)
• A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems
• On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization
• A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: A new linesearch method for quadratically constrained convex programming

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