A stable differential equation approach for inequality constrained optimization problems (Q2379039): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3231321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A differential equation approach to nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3990267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3790956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barrier-projective methods for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two differential equation systems for inequality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable exponential-penalty algorithm with superlinear convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / rank
 
Normal rank

Latest revision as of 00:01, 29 June 2024

scientific article
Language Label Description Also known as
English
A stable differential equation approach for inequality constrained optimization problems
scientific article

    Statements

    A stable differential equation approach for inequality constrained optimization problems (English)
    0 references
    0 references
    14 January 2009
    0 references
    The author proposes the solution of systems of differential equations to solve a nonlinear constrained optimization problem. For this purpose, an augmented Lagrangian is derived. From this function two systems of differential equations are obtained, where the first one corresponds to a gradient-based optimization and the second one to a Newton-like methods. For both approaches, it is shown using usual assumptions that a Karush-Kuhn-Tucker point of the constrained optimization problem is an equilibrium point of the systems of differential equations, where the systems are asymptotically stable. For the numerical solution of the differential equations, it is show that versions of the Euler method are locally convergent. Iteration counts are shown for three problems of the Hock-Schittkowski test suite.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    inequality constrained optimization
    0 references
    differential equation approach
    0 references
    numerical examples
    0 references
    asymptotical stability
    0 references
    quadratic convergence
    0 references
    modified barrier function
    0 references
    gradient-based optimization
    0 references
    Newton-like methods
    0 references
    Euler method
    0 references
    0 references
    0 references