Global optimality conditions for cubic minimization problem with box or binary constraints
type: Item
instance of: scholarly article
title: Global optimality conditions for cubic minimization problem with box or binary constraints
zbMATH Open document ID: 1228.90088
author: Zhian Liang
author: Yanjun Wang
published in: Journal of Global Optimization
publication date: 2010-10-06T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5796456
zbMATH Keywords: cubic minimization problem
zbMATH Keywords: global optimality conditions
zbMATH Keywords: box or binary constraints
MaRDI profile type: Publication
full work available at URL: s10898-009-9480-5
OpenAlex ID: W2057719826
cites work: Accelerating the cubic regularization of Newton's method on convex problems
cites work: Formulation and optimization of cubic polynomial joint trajectories for industrial robots
cites work: Global optimality conditions for quadratic optimization problems with binary constraints
cites work: Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
cites work: Conditions for global optimality. II
cites work: Global optimality conditions for nonconvex optimization
cites work: Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
cites work: Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
cites work: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
cites work: Sufficient global optimality conditions for weakly convex minimization problems
cites work: Q4830373
DOI: 10.1007/S10898-009-9480-5
description: scientific article; zbMATH DE number 5796456