Using selective orthonormalization to update the analytic center after addition of multiple cuts

DOI10.1007/s10957-004-1858-4zbMath1071.90039OpenAlexW2138386653MaRDI QIDQ1780599

John E. Mitchell, Srinivasan Ramaswamy

Publication date: 13 June 2005

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-004-1858-4

zbMATH Keywords

analytic centerslinear programmingconvex programmingCutting planeselective orthonormalization

Mathematics Subject Classification ID

Interior-point methods (90C51) Combinatorial optimization (90C27)

Related Items

Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms

Uses Software

• ACCPM

Cites Work

• Unnamed Item
• Unnamed Item
• Solving combinatorial optimization problems using Karmarkar's algorithm
• Complexity analysis of the analytic center cutting plane method that uses multiple cuts
• Multiple cuts with a homogeneous analytic center cutting plane method
• A unifying framework for several cutting plane methods for semidefinite programming
• A Potential Reduction Algorithm Allowing Column Generation
• The Analytic Center Cutting Plane Method with Semidefinite Cuts
• Computational Experience with an Interior Point Cutting Plane Algorithm
• Polynomial Interior Point Cutting Plane Methods
• A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
• Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
• An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities
• A long-step, cutting plane algorithm for linear and convex programming