Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment
DOI10.1007/S10898-015-0281-8zbMATH Open1357.90110OpenAlexW1989850971MaRDI QIDQ496622FDOQ496622
Authors: Jianming Shi, Yanjun Wang, Ruizhi Shi 
Publication date: 22 September 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0281-8
Recommendations
- DC approach to weakly convex optimization and nonconvex quadratic optimization problems
- Solution to nonconvex quadratic programming with both inequality and box constraints
- Robust duality for generalized convex programming problems under data uncertainty
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
semidefinite programmingdualityrobust dualitycertain environmenthomogenous quadratic programminguncertain environment
Cites Work
- Title not available (Why is that?)
- Linear Matrix Inequalities in System and Control Theory
- Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis
- Duality in robust optimization: Primal worst equals dual best
- Introduction to stochastic programming.
- Strong duality in robust convex programming: complete characterizations
- Robust duality for fractional programming problems with constraint-wise data uncertainty
- Problems of distance geometry and convex properties of quadratic maps
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Robust duality for generalized convex programming problems under data uncertainty
- Linear precoding via conic optimization for fixed MIMO receivers
- SDP relaxation of homogeneous quadratic optimization: approximation bounds and applications
- Rank-Constrained Separable Semidefinite Programming With Applications to Optimal Beamforming
Cited In (9)
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Characterization of Positive Definite and Semide Finite Matrices via Quadratic Programming Duality
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
- DC approach to weakly convex optimization and nonconvex quadratic optimization problems
- Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
- Characterizing optimality for a class of nonconvex quadratic robust optimization problems bilaterally quadratically constrained under interval uncertainty
- A unifying approach to robust convex infinite optimization duality
- Characterizations of robust and stable duality for linearly perturbed uncertain optimization problems
This page was built for publication: Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496622)
