Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms

DOI10.1007/s00186-007-0177-6zbMath1149.90150OpenAlexW1984447777MaRDI QIDQ2482686

Vasile L. Basescu, John E. Mitchell

Publication date: 23 April 2008

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-007-0177-6

zbMATH Keywords

column generationconic programmingcutting plane methods

Mathematics Subject Classification ID

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

Related Items

A second-order cone cutting surface method: Complexity and application

Uses Software

• CSDP

Cites Work

• Complexity analysis of the analytic center cutting plane method that uses multiple cuts
• Using selective orthonormalization to update the analytic center after addition of multiple cuts
• Complexity estimates of some cutting plane methods based on the analytic barrier
• Implementation of a primal-dual method for SDP on a shared memory parallel architecture
• Multiple Cuts in the Analytic Center Cutting Plane Method
• A Mathematical View of Interior-Point Methods in Convex Optimization
• A unifying framework for several cutting plane methods for semidefinite programming
• The Analytic Center Cutting Plane Method with Semidefinite Cuts
• A Spectral Bundle Method for Semidefinite Programming
• 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 Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
• An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities