A simple feasible SQP algorithm for inequality constrained optimization (Q858743): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.amc.2006.04.073 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2006.04.073 / rank
 
Normal rank

Latest revision as of 05:37, 10 December 2024

scientific article
Language Label Description Also known as
English
A simple feasible SQP algorithm for inequality constrained optimization
scientific article

    Statements

    A simple feasible SQP algorithm for inequality constrained optimization (English)
    0 references
    11 January 2007
    0 references
    The author considers a constrained nonlinear minimization problem of the form \[ \text{minimize }f(x)\text{ subject to }g_j(x)\leq 0,\quad j= 1,\dots, m,\tag{\(*\)} \] where \(f: \mathbb{R}^n\to \mathbb{R}^1\), \(g_j: \mathbb{R}^n\to \mathbb{R}^1\) for \(j= 1,\dots, m\) are smooth functions. A new modification of the sequential quadratic programming (SQP) algorithm for solving this problem is proposed. The search direction is a suitable combination of a descent direction, a feasible direction, and a second-order direction. The proposed algorithm either stops at the Karush-Kuhn-Tucker point of problem \((*)\), or generates an infinite sequence \(\{x^k\}\), any accumulation point of which is a Karush-Kuhn-Tucker point of problem \((*)\). Global as well as superlinear convergence under suitable additional conditions is proved.
    0 references
    sequential quadratic programming methods
    0 references
    nonlinear constrained minimization
    0 references
    global convergence
    0 references
    superlinear convergence
    0 references
    0 references

    Identifiers