Successive Optimization Method via Parametric Monotone Composition Formulation

Research output: Journal article publicationJournal articleAcademic researchpeer-review

5 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)355-369
Number of pages15
JournalJournal of Global Optimization
Issue number4
Publication statusPublished - 1 Jan 2000


  • Convexification
  • Global optimization
  • Least root problem
  • Optimality condition
  • Parametric monotone composition

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Optimization
  • Management Science and Operations Research
  • Applied Mathematics


Dive into the research topics of 'Successive Optimization Method via Parametric Monotone Composition Formulation'. Together they form a unique fingerprint.

Cite this