Penalized semidefinite programming for quadratically-constrained quadratic optimization
From MaRDI portal
Publication:2022173
DOI10.1007/s10898-020-00918-8zbMath1462.65068arXiv2004.14328OpenAlexW3035921962MaRDI QIDQ2022173
Mohsen Kheirandishfard, Ramtin Madani, Javad Lavaei, Atamtürk, Alper
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.14328
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Angular synchronization by eigenvectors and semidefinite programming
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Approximating global quadratic optimization with convex quadratic constraints
- Second-order cone programming
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Approximating quadratic programming with bound and quadratic constraints
- Quadratic maximization and semidefinite relaxation
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A polyhedral branch-and-cut approach to global optimization
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Applications of cut polyhedra. II
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- QPLIB: a library of quadratic programming instances
- A rounding procedure for semidefinite optimization
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Exact matrix completion via convex optimization
- Global Optimization with Polynomials and the Problem of Moments
- Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Semidefinite Characterization of Sum-of-Squares Cones in Algebras
- Convex Relaxation for Optimal Distributed Control Problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- On the complexity of purely complex μ computation and related problems in multidimensional systems
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS
- Separable and Localized System-Level Synthesis for Large-Scale Systems
- MIMO Radar Waveform Optimization With Prior Information of the Extended Target and Clutter
- Ambiguity Function Shaping for Cognitive Radar Via Complex Quartic Optimization
- Transformation of Optimal Centralized Controllers Into Near-Globally Optimal Static Distributed Controllers
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
- LP Formulations for Polynomial Optimization Problems
- Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
- A System-Level Approach to Controller Synthesis
- The geometric measure of multipartite entanglement and the singular values of a hypermatrix
- A Characterization of Convex Problems in Decentralized Control$^ast$
- Blind constant modulus equalization via convex optimization
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Approximation Methods for Polynomial Optimization
- Cuts for Conic Mixed-Integer Programming
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Complex Quadratic Optimization and Semidefinite Programming
- Fast Software Encryption
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Phase Retrieval via Matrix Completion
