A New Global Optimization Algorithm for Solving a Class of Nonconvex Programming Problems
A new two-part parametric linearization technique is proposed globally to a class of nonconvex programming problems (NPP). Firstly, a two-part parametric linearization method is adopted to construct the underestimator of objective and constraint functions, by utilizing a transformation and a paramet...
Saved in:
| Main Authors: | Xue-Gang Zhou, Bing-Yuan Cao |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/697321 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Short Paper - A note on the Frank–Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems
by: de Oliveira, Welington
Published: (2023-01-01) -
Generic existence of solutions of nonconvex optimal control problems
by: Alexander J. Zaslavski
Published: (2005-01-01) -
Implicit Schemes for Solving Extended General Nonconvex Variational Inequalities
by: Muhammad Aslam Noor, et al.
Published: (2012-01-01) -
On the minimization of some nonconvex double obstacle problems
by: A. Elfanni
Published: (2003-01-01) -
A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem
by: Lin-Peng Yang, et al.
Published: (2014-01-01)