Global optimality conditions for cubic minimization problem with box or binary constraints
From MaRDI portal
Publication:1959231
DOI10.1007/s10898-009-9480-5zbMath1228.90088OpenAlexW2057719826MaRDI QIDQ1959231
Publication date: 6 October 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9480-5
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (8)
Optimality conditions and optimization methods for quartic polynomial optimization ⋮ Global optimality conditions for fixed charge quadratic programs ⋮ Existence and sensitivity analysis for nonconvex cubic optimization problems ⋮ Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables ⋮ Global optimality conditions for cubic minimization problems with cubic constraints ⋮ Global sufficient optimality conditions for a special cubic minimization problem ⋮ Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations ⋮ On the Consistent Path Problem
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
- 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
This page was built for publication: Global optimality conditions for cubic minimization problem with box or binary constraints