A second-order cone cutting surface method: Complexity and application
type: Item
instance of: scholarly article
title: A second-order cone cutting surface method: Complexity and application
zbMATH Open document ID: 1170.90456
author: Mohammad R. Oskoorouchi
author: John E. Mitchell
published in: Computational Optimization and Applications
publication date: 2009-09-02T00:00:00Z
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 5601556
zbMATH Keywords: second-order cone
zbMATH Keywords: semidefinite inequality
zbMATH Keywords: cutting plane techniques
zbMATH Keywords: semidefinite programming
describes a project that uses: SDPLIB
describes a project that uses: CSDP
describes a project that uses: SeDuMi
describes a project that uses: SDPT3
describes a project that uses: SDPLR
MaRDI profile type: Publication
full work available at URL: s10589-007-9141-x
OpenAlex ID: W2031237214
cites work: Second-order cone programming
cites work: A cutting plane algorithm for convex programming that uses analytic centers
cites work: CSDP, A C library for semidefinite programming
cites work: Computational enhancements in low-rank semidefinite programming
cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
cites work: Local minima and convergence in low-rank semidefinite programming
cites work: Multiple cuts in the analytic center cutting plane method
cites work: Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
cites work: A Spectral Bundle Method for Semidefinite Programming
cites work: Numerical evaluation of SBmethod
cites work: Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
cites work: A unifying framework for several cutting plane methods for semidefinite programming
cites work: A semidefinite programming based polyhedral cut and price approach for the maxcut problem
cites work: Q5690370
cites work: An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
cites work: A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
cites work: The Analytic Center Quadratic Cut Method for Strongly Monotone Variational Inequality Problems
cites work: Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
cites work: Solving combinatorial optimization problems using Karmarkar's algorithm
cites work: The Analytic Center Cutting Plane Method with Semidefinite Cuts
cites work: An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities
cites work: A matrix generation approach for eigenvalue optimization
cites work: Large-Scale Optimization of Eigenvalues
cites work: An analytic center quadratic cut method for the convex quadratic feasibility problem
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
cites work: An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
cites work: A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
cites work: Solving semidefinite-quadratic-linear programs using SDPT3
cites work: A Potential Reduction Algorithm Allowing Column Generation
cites work: Complexity analysis of the analytic center cutting plane method that uses multiple cuts
DOI: 10.1007/S10589-007-9141-X
description: scientific article; zbMATH DE number 5601556