On convexification for a class of global optimization problems
From MaRDI portal
Publication:2676158
DOI10.1007/s40305-021-00379-0OpenAlexW4210462217MaRDI QIDQ2676158
Qian Yan, Yang, Xinmin, Zhi-You Wu
Publication date: 27 September 2022
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-021-00379-0
Cites Work
- Unnamed Item
- Convexification and concavification for a general class of global optimization problems
- On the convexification of nonlinear programming problems: An applications-oriented survey
- Convexification of nonsmooth monotone functions
- An exact solution method for reliability optimization in complex systems
- Hidden convex minimization
- Convexification and existence of a saddle point in a \(p\)th-power reformulation for nonconvex constrained optimization.
- Zero duality gap for a class of nonconvex optimization problems
- Introduction to global optimization
- Local convexification of the Lagrangian function in nonconvex optimization
- Monotonic Optimization: Problems and Solution Approaches
- An alogrithm for monotonic global optimization problems∗
- A class of convexification and concavification methods for non-monotone optimization problems
- Saddle point generation in nonlinear nonconvex optimization
- Functional Analysis
- Convexification of a noninferior frontier
- A new approach to optimization under monotonic constraint
- A convexification method for a class of global optimization problems with applications to reliability optimization
- Existence of a saddle point in nonconvex constrained optimization.
- Convexification, concavification and monotonization in global optimization
This page was built for publication: On convexification for a class of global optimization problems
