A new linesearch method for quadratically constrained convex programming

DOI10.1016/0167-6377(94)90062-0zbMath0829.90103OpenAlexW2089126119MaRDI QIDQ1342277

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

quadratic objective functioninterior point methodsquadratic constraintslinesearchimproved Newton methodstep optimizationtransformed derivative

Mathematics Subject Classification ID

Quadratic programming (90C20)

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Unified complexity analysis for Newton LP methods
• Modified barrier functions (theory and methods)
• Generation of degenerate linear programming problems
• 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
• Line Search Procedures for the Logarithmic Barrier Function
• Achievable potential reductions in the method of Kojima et al. in the case of linear programming
• A New Method for Optimal Truss Topology Design
• The Variable Reduction Method for Nonlinear Programming