A unifying framework for several cutting plane methods for semidefinite programming
From MaRDI portal
Publication:3377972
DOI10.1080/10556780500065283zbMATH Open1181.90215OpenAlexW2023349184MaRDI QIDQ3377972FDOQ3377972
Authors: Kartik Krishnan, John E. Mitchell 
Publication date: 29 March 2006
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500065283
Recommendations
- scientific article; zbMATH DE number 1182577
- scientific article; zbMATH DE number 6135091
- scientific article; zbMATH DE number 2196287
- Cutting plane algorithms for nonlinear semi-definite programming problems with applications
- A relaxed cutting plane method for semi-infinite semi-definite programming
- scientific article; zbMATH DE number 1757960
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- A cutting-plane method for quadratic semi infinite programming problems
- scientific article; zbMATH DE number 3984967
semidefinite programmingnon-differentiable optimizationactive set approachesinterior point cutting plane methods
Cites Work
- Numerical evaluation of SBmethod
- Title not available (Why is that?)
- A Spectral Bundle Method for Semidefinite Programming
- Semidefinite Programming
- A spectral bundle method with bounds
- Title not available (Why is that?)
- Proximity control in bundle methods for convex nondifferentiable minimization
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Newton's method for convex programming and Tschebyscheff approximation
- Polynomial Interior Point Cutting Plane Methods
- Large-Scale Optimization of Eigenvalues
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- Title not available (Why is that?)
Cited In (25)
- A framework for solving mixed-integer semidefinite programs
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis
- A second-order cone cutting surface method: Complexity and application
- A matrix generation approach for eigenvalue optimization
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
- Polyhedral approximations of the semidefinite cone and their application
- A guide to conic optimisation and its applications
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- On polyhedral and second-order cone decompositions of semidefinite optimization problems
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
- Using selective orthonormalization to update the analytic center after addition of multiple cuts
- On linear programs with linear complementarity constraints
- Title not available (Why is that?)
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
- On parameterized dissipation inequalities and receding horizon robust control
- A relaxed cutting plane method for semi-infinite semi-definite programming
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- Title not available (Why is that?)
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
Uses Software
This page was built for publication: A unifying framework for several cutting plane methods for semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3377972)
