Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints (Q983712): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Complementarity Constraints: Convergence Properties of a Smoothing Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing method for mathematical programs with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified relaxation scheme for mathematical programs with complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of regularization and penalization schemes for MPECs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Penalization of Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial augmented Lagrangian method and mathematical programs with complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence analysis of an augmented Lagrangian method for mathematical programs with complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-order penalty methods for mathematical programs with complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Augmented Lagrangian Methods with General Lower-Level Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical comparison of augmented Lagrangian algorithms for nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual nonlinear rescaling method with dynamic scaling parameter update / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear rescaling vs. smoothing technique in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the exponential multiplier method for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Augmented Lagrangian Function with Improved Exactness Properties / rank
 
Normal rank

Revision as of 00:48, 3 July 2024

scientific article
Language Label Description Also known as
English
Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints
scientific article

    Statements

    Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints (English)
    0 references
    0 references
    24 July 2010
    0 references
    Mathematical programs with complementarity constraints (MPCC) form an important class of mathematical programs with equilibrium constraints and have wide applications in economics and engineering. Due to the presence of the complementarity conditions, the Mangasarian-Fromovitz constraint qualification and the linear independence constraint qualification are not satisfied at a feasible point of MPCC. As a result, the traditional nonlinear programming methods cannot be applied directly to MPCC. Complementarity problems can be considered as special case of variational inequalities. In recent years, much attention has been drawn to the study of MPCC. The purpose of this paper is to investigate the convergence of partially augmented Lagrangian methods for solving MPCC without appealing to the restrictive boundedness assumption of the Lagrangian multipliers. Four modified partially augmented Lagrangian methods for solving MPCC based on different algorithmic strategies are proposed and analyzed. The convergence to a B-stationary point of MPCC is established for the four modified partially augmented Lagrangian methods without requiring the boundedness of the Lagrangian multipliers.
    0 references
    mathematical program with complementarity constraints
    0 references
    modified partially augmented Lagrangian methods
    0 references
    convergence to B-stationary point
    0 references
    constraint qualifications
    0 references
    boundedness of the multipliers
    0 references
    0 references
    0 references
    0 references

    Identifiers