Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/34786
Title: Successive optimization method via parametric monotone composition formulation
Authors: Yang, XQ 
Li, D
Keywords: Global optimization
Parametric monotone composition
Convexification
Optimality condition
Least root problem
Issue Date: 2000
Publisher: Springer
Source: Journal of global optimization, 2000, v. 16, no. 4, p. 355-369 How to cite?
Journal: Journal of global optimization
Abstract: In this paper a successive optimization method for solving inequality constrained optimization problems is introduced via a parametric monotone composition reformulation. The global optimal value of the original constrained optimization problem is shown to be the least root of the optimal value function of an auxiliary parametric optimization problem, thus can be found via a bisection method. The parametric optimization subproblem is formulated in such a way that it is a one-parameter problem and its value function is a monotone composition function with respect to the original objective function and the constraints. Various forms can be taken in the parametric optimization problem in accordance with a special structure of the original optimization problem, and in some cases, the parametric optimization problems are convex composite ones. Finally, the parametric monotone composite reformulation is applied to study local optimality.
URI: http://hdl.handle.net/10397/34786
ISSN: 0925-5001 (print)
1573-2916 (online)
DOI: 10.1023/A:1008356305392
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
Citations as of Jun 23, 2017

Page view(s)

21
Last Week
1
Last month
Checked on Jun 25, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.