Global sufficient optimality conditions for a special cubic minimization problem
From MaRDI portal
Publication:1955308
DOI10.1155/2012/871741zbMath1264.90163WikidataQ58912593 ScholiaQ58912593MaRDI QIDQ1955308
Yan-Jun Wang, Wei-Min Ma, Xiao-Mei Zhang
Publication date: 11 June 2013
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/871741
90C30: Nonlinear programming
Related Items
Existence and sensitivity analysis for nonconvex cubic optimization problems, Global optimality conditions for cubic minimization problems with cubic constraints
Cites Work
- Unnamed Item
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Accelerating the cubic regularization of Newton's method on convex problems
- Global optimality conditions for nonconvex optimization
- Conditions for global optimality. II
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Global optimality conditions for cubic minimization problem with box or binary constraints
- Sufficient global optimality conditions for weakly convex minimization problems
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Formulation and optimization of cubic polynomial joint trajectories for industrial robots
