Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
From MaRDI portal
Publication:2482686
Recommendations
- Using selective orthonormalization to update the analytic center after addition of multiple cuts
- A second-order cone cutting surface method: Complexity and application
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- An analytic center cutting plane approach for conic programming
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
Cites work
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- A Spectral Bundle Method for Semidefinite Programming
- A mathematical view of interior-point methods in convex optimization
- A unifying framework for several cutting plane methods for semidefinite programming
- 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
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Complexity analysis of the analytic center cutting plane method that uses 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
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- Using selective orthonormalization to update the analytic center after addition of multiple cuts
Cited in
(2)
This page was built for publication: Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482686)