Sufficient global optimality conditions for weakly convex minimization problems

DOI10.1007/S10898-007-9147-ZzbMath1149.90154OpenAlexW2060136900MaRDI QIDQ2426678

Yanyan Li

Publication date: 23 April 2008

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-007-9147-z

zbMATH Keywords

Global optimizationOptimality conditionsWeakly convex minimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation with constraints (41A29) Rate of convergence, degree of approximation (41A25)

Related Items (8)

Zero duality gap conditions via abstract convexity ⋮ Global sufficient optimality conditions for a special cubic minimization problem ⋮ Global optimality conditions for cubic minimization problem with box or binary constraints ⋮ Optimization methods for mixed integer weakly concave programming problems ⋮ Global optimality conditions for some classes of optimization problems ⋮ Characterization of solutions of strong-weak convex programming problems ⋮ Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems ⋮ Sufficient conditions for a minimum of a strongly quasiconvex function on a weakly convex set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient global optimality conditions for bivalent quadratic optimization
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
• Optimality conditions in global optimization and their applications
• Conditions for global optimality. II
• Handbook of global optimization
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• 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
• Strong and Weak Convexity of Sets and Functions
• Abstract convexity and global optimization

This page was built for publication: Sufficient global optimality conditions for weakly convex minimization problems