A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints (Q2353465): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4003375 / 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 globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalty-free method with line search for nonlinear equality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly and superlinearly convergent SQP algorithm for optimization problems with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Regularization Scheme for Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Noninterior Continuation Methods for Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity 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: A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints / rank
 
Normal rank

Revision as of 12:04, 10 July 2024

scientific article
Language Label Description Also known as
English
A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints
scientific article

    Statements

    A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints (English)
    0 references
    0 references
    0 references
    0 references
    14 July 2015
    0 references
    mathematical programs
    0 references
    complementarity constraints
    0 references
    QP-free
    0 references
    penalty-function-free
    0 references
    filter-free
    0 references
    global convergence
    0 references
    0 references

    Identifiers