Exact dual bounds for some nonconvex minimax quadratic optimization problems
From MaRDI portal
Publication:2043977
Recommendations
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- scientific article; zbMATH DE number 16323
- Exactness criteria for SDP-relaxations of quadratic extremum problems
- scientific article; zbMATH DE number 4070633
- Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
Cites work
- scientific article; zbMATH DE number 724202 (Why is no real title available?)
- scientific article; zbMATH DE number 1534299 (Why is no real title available?)
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- Computational combinatorial optimization. Optimal of probably near-optimal solutions
- Constrained global optimization: algorithms and applications
- Convex relaxations of the weighted maxmin dispersion problem
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- Exactness criteria for SDP-relaxations of quadratic extremum problems
- Handbook of global optimization
- Linear programming relaxations of quadratically constrained quadratic programs
- Minimax quadratic optimization and its application to investment planning
- Nondifferentiable optimization and polynomial problems
- On Lagrangian relaxation of quadratic matrix constraints
- On the accuracy of dual bounds for quadratic extremum problems
- Optimization of Structural and Mechanical Systems
- Robust optimization
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Second-order-cone constraints for extended trust-region subproblems
- Semidefinite programming relaxation for nonconvex quadratic programs
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Strong duality in robust convex programming: complete characterizations
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain
Cited in
(8)- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- A class of problems where dual bounds beat underestimation bounds
- scientific article; zbMATH DE number 16323 (Why is no real title available?)
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems
- On the accuracy of dual bounds for quadratic extremum problems
- On solving nonconvex optimization problems by reducing the duality gap
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball
This page was built for publication: Exact dual bounds for some nonconvex minimax quadratic optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043977)
