Global optimality conditions for some classes of optimization problems
From MaRDI portal
Publication:970570
DOI10.1007/s10957-009-9616-2zbMath1196.90099OpenAlexW2044942272MaRDI QIDQ970570
Publication date: 19 May 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-009-9616-2
Related Items
Generalized subdifferentials of the sign change counting function ⋮ Q-subdifferential and Q-conjugate for global optimality ⋮ A new global optimization technique by auxiliary function method in a directional search ⋮ Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition ⋮ Global optimality conditions for cubic minimization problems with cubic constraints ⋮ D.C. programming approach for solving an applied ore-processing problem ⋮ Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sufficient global optimality conditions for bivalent quadratic optimization
- Generalized Fenchel's conjugation formulas and duality for abstract convex functions
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Optimality conditions in global optimization and their applications
- Conditions for global optimality. II
- A finite algorithm for solving general quadratic problems
- Using copositivity for global optimality criteria in concave quadratic programming problems
- 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
- Strong and Weak Convexity of Sets and Functions
- A Global Optimization Algorithm for Concave Quadratic Programming Problems
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Convex analysis and global optimization
- Abstract convexity and global optimization
This page was built for publication: Global optimality conditions for some classes of optimization problems
