Global optimality conditions for cubic minimization problems with cubic constraints
type: Item
instance of: scholarly article
title: Global optimality conditions for cubic minimization problems with cubic constraints
zbMATH Open document ID: 1329.90115
author: Xue-Gang Zhou
author: Xiao-Peng Yang
author: Bingyuan Cao
published in: Mathematical Methods of Operations Research
publication date: 2016-01-25T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6535225
zbMATH Keywords: cubic minimization
zbMATH Keywords: global optimality conditions
zbMATH Keywords: quadratic underestimators
describes a project that uses: GloptiPoly
describes a project that uses: SeDuMi
MaRDI profile type: Publication
full work available at URL: s00186-015-0511-3
OpenAlex ID: W1142877830
cites work: Computational experience with a new class of convex underestimators: Box-constrained NLP problems
cites work: A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
cites work: Global optimality conditions for quadratic optimization problems with binary constraints
cites work: Global optimality conditions for quadratic \(0-1\) optimization problems
cites work: LMI Techniques for Optimization Over Polynomials in Control: A Survey
cites work: A note on diagonally dominant matrices
cites work: Necessary and sufficient global optimality conditions for convex maximization revisited
cites work: GloptiPoly
cites work: Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
cites work: Q4889854
cites work: Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
cites work: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
cites work: Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
cites work: Global minimization of difference of quadratic and convex functions over box or binary constraints
cites work: New sufficiency for global optimality and duality of mathematical programming problems via underestimators
cites work: Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
cites work: CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
cites work: Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
cites work: Formulation and optimization of cubic polynomial joint trajectories for industrial robots
cites work: Nonconvex piecewise-quadratic underestimation for global minimization
cites work: Iterative convex quadratic approximation for global optimization in protein docking
cites work: Global optimization in protein docking using clustering, underestimation and semidefinite programming
cites work: Accelerating the cubic regularization of Newton's method on convex problems
cites work: Minimizing polynomials via sum of squares over the gradient ideal
cites work: SDU: A Semidefinite Programming-Based Underestimation Method for Stochastic Global Optimization in Protein Docking
cites work: Sufficient global optimality conditions for bivalent quadratic optimization
cites work: Abstract convexity and global optimization
cites work: Convex analysis and global optimization
cites work: Global optimality conditions for cubic minimization problem with box or binary constraints
cites work: Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
cites work: Global optimality conditions for some classes of optimization problems
cites work: Global sufficient optimality conditions for a special cubic minimization problem
cites work: Q4906142
DOI: 10.1007/S00186-015-0511-3
description: scientific article; zbMATH DE number 6535225