Exact dual bounds for some nonconvex minimax quadratic optimization problems
From MaRDI portal
Publication:2043977
DOI10.1007/s10559-021-00333-1zbMath1472.90152OpenAlexW3127517610MaRDI QIDQ2043977
Publication date: 4 August 2021
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-021-00333-1
Lagrangian relaxationpositive definite matrixexact dual boundminimax quadratic optimization problemSOCP relaxation
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the accuracy of dual bounds for quadratic extremum problems
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Exactness criteria for SDP-relaxations of quadratic extremum problems
- Constrained global optimization: algorithms and applications
- Handbook of global optimization
- Semidefinite programming relaxation for nonconvex quadratic programs
- Nondifferentiable optimization and polynomial problems
- Minimax quadratic optimization and its application to investment planning
- Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain
- On Lagrangian Relaxation of Quadratic Matrix Constraints
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- Convex Relaxations of the Weighted Maxmin Dispersion Problem
- Optimization of Structural and Mechanical Systems
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Computational combinatorial optimization. Optimal of probably near-optimal solutions
