A robust Lagrangian-DNN method for a class of quadratic optimization problems
From MaRDI portal
Publication:523570
DOI10.1007/s10589-016-9879-0zbMath1366.90152OpenAlexW2527801029MaRDI QIDQ523570
Naohiko Arima, Sunyoung Kim, Kim-Chuan Toh, Kojima, Masakazu
Publication date: 21 April 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9879-0
improved bisection methodLagrangian-DNN relaxationnonconvex quadratic optimization problems with nonnegative variablesvalidity of lower bounds
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints, Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures, A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems, Amenable cones: error bounds without constraint qualifications, Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems, Polyhedral approximations of the semidefinite cone and their application, Algorithm 996, A Newton-bracketing method for a simple conic optimization problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Global Optimization with Polynomials and the Problem of Moments
- Approximation of the Stability Number of a Graph via Copositive Programming
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Some NP-complete problems in quadratic and nonlinear programming
- CSDP, A C library for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- On Doubly Positive Semidefinite Programming Relaxations
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
