Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems
From MaRDI portal
Publication:2810546
DOI10.1137/140976856zbMath1338.90293OpenAlexW2408221553MaRDI QIDQ2810546
Aharon Ben-Tal, Shimrit Shtern
Publication date: 3 June 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140976856
quadratic programmingsemidefinite programmingnonconvex optimizationapproximation methods and heuristics
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A semi-definite programming approach for robust tracking
- Sublinear time algorithms for approximate semidefinite programming
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Second-order and related extremality conditions in nonlinear programming
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis
- A review of recent advances in global optimization
- A boundary point method to solve semidefinite programs
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Problems of distance geometry and convex properties of quadratic maps
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Introductory lectures on convex optimization. A basic course.
- Approximating quadratic programming with bound and quadratic constraints
- Quadratic maximization and semidefinite relaxation
- A relaxation method for nonconvex quadratically constrained quadratic programs
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- On maximization of quadratic form over intersection of ellipsoids with common center
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Phase recovery, MaxCut and complex semidefinite programming
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems
- Maximum Block Improvement and Polynomial Optimization
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Settling the Complexity of Local Max-Cut (Almost) Completely
- Computing a Trust Region Step
- An Augmented Primal-Dual Method for Linear Conic Programs
- Matrix Analysis
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Newton’s Method with a Model Trust Region Modification
- An algorithm for nonconvex programming problems
- P-Complete Approximation Problems
- Monotone Operators and the Proximal Point Algorithm
- Numerical Optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constraints
- Integer Linear Programs and Local Search for Max-Cut
- An Interior-Point Method for Semidefinite Programming
- Regularization Methods for Semidefinite Programming
- Complex Quadratic Optimization and Semidefinite Programming
- Proximité et dualité dans un espace hilbertien
- On search directions for minimization algorithms
- Extended Matrix Cube Theorems with Applications to μ-Theory in Control
- Convergence of a block coordinate descent method for nondifferentiable minimization
