Global optimality conditions for cubic minimization problems with cubic constraints
From MaRDI portal
Publication:907371
DOI10.1007/s00186-015-0511-3zbMath1329.90115OpenAlexW1142877830MaRDI QIDQ907371
Xue-Gang Zhou, Xiao-Peng Yang, Bing-Yuan Cao
Publication date: 25 January 2016
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-015-0511-3
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
- Sufficient global optimality conditions for bivalent quadratic optimization
- Global minimization of difference of quadratic and convex functions over box or binary constraints
- Global optimality conditions for some classes of optimization problems
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Accelerating the cubic regularization of Newton's method on convex problems
- Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
- New sufficiency for global optimality and duality of mathematical programming problems via underestimators
- Necessary and sufficient global optimality conditions for convex maximization revisited
- A note on diagonally dominant matrices
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Global sufficient optimality conditions for a special cubic minimization problem
- Global optimality conditions for cubic minimization problem with box or binary constraints
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- Iterative convex quadratic approximation for global optimization in protein docking
- Minimizing polynomials via sum of squares over the gradient ideal
- Nonconvex piecewise-quadratic underestimation for global minimization
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Formulation and optimization of cubic polynomial joint trajectories for industrial robots
- CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
- LMI Techniques for Optimization Over Polynomials in Control: A Survey
- SDU: A Semidefinite Programming-Based Underestimation Method for Stochastic Global Optimization in Protein Docking
- Global optimization in protein docking using clustering, underestimation and semidefinite programming
- GloptiPoly
- Convex analysis and global optimization
- Abstract convexity and global optimization
This page was built for publication: Global optimality conditions for cubic minimization problems with cubic constraints
