A unifying framework for several cutting plane methods for semidefinite programming
From MaRDI portal
Publication:3377972
DOI10.1080/10556780500065283zbMath1181.90215OpenAlexW2023349184MaRDI QIDQ3377972
Kartik Krishnan, John E. Mitchell
Publication date: 29 March 2006
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500065283
semidefinite programmingnon-differentiable optimizationactive set approachesinterior point cutting plane methods
Related Items
On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems ⋮ A second-order cone cutting surface method: Complexity and application ⋮ Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints ⋮ A matrix generation approach for eigenvalue optimization ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ On linear programs with linear complementarity constraints ⋮ A guide to conic optimisation and its applications ⋮ A framework for solving mixed-integer semidefinite programs ⋮ Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems ⋮ On parameterized dissipation inequalities and receding horizon robust control ⋮ Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms ⋮ A semidefinite programming heuristic for quadratic programming problems with complementarity constraints ⋮ Using selective orthonormalization to update the analytic center after addition of multiple cuts ⋮ Polyhedral approximations of the semidefinite cone and their application ⋮ A semidefinite programming based polyhedral cut and price approach for the maxcut problem ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ On polyhedral and second-order cone decompositions of semidefinite 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 ⋮ Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximity control in bundle methods for convex nondifferentiable minimization
- Newton's method for convex programming and Tschebyscheff approximation
- A spectral bundle method with bounds
- Numerical evaluation of SBmethod
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Large-Scale Optimization of Eigenvalues
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- A Spectral Bundle Method for Semidefinite Programming
- Polynomial Interior Point Cutting Plane Methods
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- Semidefinite Programming
- An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
This page was built for publication: A unifying framework for several cutting plane methods for semidefinite programming
