A second-order cone cutting surface method: Complexity and application
From MaRDI portal
Publication:839677
DOI10.1007/S10589-007-9141-XzbMATH Open1170.90456OpenAlexW2031237214MaRDI QIDQ839677FDOQ839677
John E. Mitchell, Mohammad R. Oskoorouchi
Publication date: 2 September 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9141-x
Cites Work
- Title not available (Why is that?)
- CSDP, A C library for semidefinite programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Numerical evaluation of SBmethod
- Solving semidefinite-quadratic-linear programs using SDPT3
- A Spectral Bundle Method for Semidefinite Programming
- Second-order cone programming
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Local minima and convergence in low-rank semidefinite programming
- Computational enhancements in low-rank semidefinite programming
- Solving combinatorial optimization problems using Karmarkar's algorithm
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- A cutting plane algorithm for convex programming that uses analytic centers
- A matrix generation approach for eigenvalue optimization
- A Potential Reduction Algorithm Allowing Column Generation
- Large-Scale Optimization of Eigenvalues
- An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
- A unifying framework for several cutting plane methods for semidefinite programming
- Multiple cuts in the analytic center cutting plane method
- Complexity analysis of the analytic center cutting plane method that uses multiple cuts
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- An analytic center quadratic cut method for the convex quadratic feasibility problem
- A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
- Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- The Analytic Center Quadratic Cut Method for Strongly Monotone Variational Inequality Problems
- An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities
Cited In (3)
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
Uses Software
This page was built for publication: A second-order cone cutting surface method: Complexity and application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839677)
