A unifying framework for several cutting plane methods for semidefinite programming
From MaRDI portal
Publication:3377972
DOI10.1080/10556780500065283zbMATH Open1181.90215OpenAlexW2023349184MaRDI QIDQ3377972FDOQ3377972
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
Cites work
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 1894380 (Why is no real title available?)
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- A Spectral Bundle Method for Semidefinite Programming
- A spectral bundle method with bounds
- An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- Large-Scale Optimization of Eigenvalues
- Newton's method for convex programming and Tschebyscheff approximation
- Numerical evaluation of SBmethod
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Polynomial Interior Point Cutting Plane Methods
- Proximity control in bundle methods for convex nondifferentiable minimization
- Semidefinite Programming
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming
Cited in
(27)- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
- A guide to conic optimisation and its applications
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- A cutting plane method for solving KYP-SDPs
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- A framework for solving mixed-integer semidefinite programs
- scientific article; zbMATH DE number 6135091 (Why is no real title available?)
- An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- A relaxed cutting plane method for semi-infinite semi-definite programming
- A matrix generation approach for eigenvalue optimization
- On linear programs with linear complementarity constraints
- A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis
- On parameterized dissipation inequalities and receding horizon robust control
- On polyhedral and second-order cone decompositions of semidefinite optimization problems
- scientific article; zbMATH DE number 1182577 (Why is no real title available?)
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
- Using selective orthonormalization to update the analytic center after addition of multiple 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
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- A second-order cone cutting surface method: Complexity and application
- Polyhedral approximations of the semidefinite cone and their application
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)
