Computational methods for solving nonconvex block-separable constrained quadratic problems
From MaRDI portal
Recommendations
- A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS^1
- A solver for nonconvex bound-constrained quadratic optimization
- A novel optimization method for nonconvex quadratically constrained quadratic programs
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- Numerical solution of special problems of nonconvex quadratic programming
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- A branch and bound algorithm for nonconvex quadratic programming with quadratic constraints
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- scientific article; zbMATH DE number 569957
- Square quadratic proximal method for nonlinear complementarity problems
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A boundary point method to solve semidefinite programs
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A relaxation method for nonconvex quadratically constrained quadratic programs
- A review of recent advances in global optimization
- A semi-definite programming approach for robust tracking
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- An Augmented Primal-Dual Method for Linear Conic Programs
- An Interior-Point Method for Semidefinite Programming
- An algorithm for nonconvex programming problems
- Approximating quadratic programming with bound and quadratic constraints
- Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constraints
- Complex Quadratic Optimization and Semidefinite Programming
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- Computing a Trust Region Step
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Extended Matrix Cube Theorems with Applications to μ-Theory in Control
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Integer Linear Programs and Local Search for Max-Cut
- Introductory lectures on convex optimization. A basic course.
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Matrix Analysis
- Maximum block improvement and polynomial optimization
- Monotone Operators and the Proximal Point Algorithm
- Newton’s Method with a Model Trust Region Modification
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Numerical Optimization
- On maximization of quadratic form over intersection of ellipsoids with common center
- On search directions for minimization algorithms
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- P-Complete Approximation Problems
- Phase recovery, MaxCut and complex semidefinite programming
- Problems of distance geometry and convex properties of quadratic maps
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximité et dualité dans un espace hilbertien
- Quadratic maximization and semidefinite relaxation
- Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis
- Regularization methods for semidefinite programming
- Second-order and related extremality conditions in nonlinear programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Settling the complexity of local max-cut (almost) completely
- Sublinear time algorithms for approximate semidefinite programming
Cited in
(3)- A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS^1
This page was built for publication: Computational methods for solving nonconvex block-separable constrained quadratic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810546)
