TITLE

Constraint incorporation in optimization

AUTHOR(S)
Levy, Adam B.
PUB. DATE
September 2007
SOURCE
Mathematical Programming;Sep2007, Vol. 110 Issue 3, p615
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations) cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods, barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework relies on addition and chain rules for constraint incorporation which we develop here.
ACCESSION #
25234940

 

Related Articles

  • An inexact Newton method for nonconvex equality constrained optimization. Byrd, Richard H.; Curtis, Frank E.; Nocedal, Jorge // Mathematical Programming;Apr2010, Vol. 122 Issue 2, p273 

    We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For strictly convex problems, the method reduces to the inexact sequential quadratic programming approach proposed by Byrd et al. [SIAM J. Optim. 19(1)...

  • On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems. Cafieri, S.; D'Apuzzo, M.; De Simone, V.; Di Serafino, D. // Computational Optimization & Applications;Sep2007, Vol. 38 Issue 1, p27 

    Iterative solvers appear to be very promising in the development of efficient software, based on Interior Point methods, for large-scale nonlinear optimization problems. In this paper we focus on the use of preconditioned iterative techniques to solve the KKT system arising at each iteration of...

  • Multitarget Linear-Quadratic Control Problem: Semi-Infinite Interval. Faybusovich, L.; Mouktonglang, T. // Mathematical Problems in Engineering;2012, Vol. 2012, Special section p1 

    We consider multitarget linear-quadratic control problem on semi-infinite interval. We show that the problem can be reduced to a simple convex optimization problem on the simplex.

  • A second-derivative SQP method with a ‘trust-region-free’ predictor step. Gould, Nicholas I. M.; Robinson, Daniel P. // IMA Journal of Numerical Analysis;Apr2012, Vol. 32 Issue 2, p580 

    Gould and Robinson (2010, SIAM J. Optim., 20, 2023–2048; 2010, SIAM J. Optim., 20, 2049–2079) introduced a second-derivative sequential quadratic programming method (S2QP) for solving nonlinear nonconvex optimization problems. We proved that the method is globally and locally...

  • Multitarget Linear-Quadratic Control Problem: Semi-Infinite Interval. Faybusovich, L.; Mouktonglang, T. // Mathematical Problems in Engineering;2012, Vol. 2012, Special section p1 

    We consider multitarget linear-quadratic control problem on semi-infinite interval. We show that the problem can be reduced to a simple convex optimization problem on the simplex.

  • Case Studies for a First-Order Robust Nonlinear Programming Formulation. Hale, E. T.; Zhang, Y. // Journal of Optimization Theory & Applications;Jul2007, Vol. 134 Issue 1, p27 

    In this paper, we conduct three case studies to assess the effectiveness of a recently proposed first-order method for robust nonlinear programming [Zhang, Y.: J. Optim. Theory Appl. 132, 111-124 (2007)]. Three robust nonlinear programming problems were chosen from the literature using the...

  • Flexible penalty functions for nonlinear constrained optimization. Curtis, Frank E.; Nocedal, Jorge // IMA Journal of Numerical Analysis;Oct2008, Vol. 28 Issue 4, p749 

    We propose a globalization strategy for nonlinear constrained optimization. The method employs a �flexible� penalty function to promote convergence, where during each iteration the penalty parameter can be chosen as any number within a prescribed interval, rather than a fixed value....

  • A global continuation algorithm for solving binary quadratic programming problems. Pan, Shaohua; Tan, Tao; Jiang, Yuxi // Computational Optimization & Applications;Dec2008, Vol. 41 Issue 3, p349 

    In this paper, we propose a new continuous approach for the unconstrained binary quadratic programming (BQP) problems based on the Fischer-Burmeister NCP function. Unlike existing relaxation methods, the approach reformulates a BQP problem as an equivalent continuous optimization problem, and...

  • Discrete Filled Function Method for Discrete Global Optimization. Chi-Kong Ng; Lian-Sheng Zhang; Duan Li; Wei-wen Tian // Computational Optimization & Applications;May2005, Vol. 31 Issue 1, p87 

    A discrete filled function method is developed in this paper to solve discrete global optimization problems over ‘strictly pathwise connected domains.’ Theoretical properties of the proposed discrete filled function are investigated and a solution algorithm is proposed. Numerical...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics