An infeasible nonmonotone SSLE algorithm for nonlinear programming

DOI10.1007/S00186-009-0287-4MaRDI QIDQ2379186zbMATH OpenOpenAlexFDO

Authors Chungen Shen, Wenjuan Xue, Dingguo Pu

Publication date 19 March 2010

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00186-009-0287-4

zbMATH Keywords

algorithmglobal convergencelinear searchnonlinear programmingnonmonotonicitynumerical examplessequential systems of linear equations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A nonmonotone sequential systems of linear equations algorithm
• AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY
• An infeasible active-set QP-free algorithm for general nonlinear programming
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
• A nonmonotone SQP method for nonlinear programming without a penalty function

Cites work

• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
• A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
• A QP-free and superlinearly convergent algorithm for inequality constrained optimizations
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
• An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point
• An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
• Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
• scientific article; zbMATH DE number 1880805 (Why is no real title available?)
• scientific article; zbMATH DE number 780774 (Why is no real title available?)
• Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
• Nonlinear programming without a penalty function.
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
• Stabilized sequential quadratic programming
• Test examples for nonlinear programming codes

Cited in

(7)

• An interior point method for nonlinear optimization with a quasi-tangential subproblem
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
• A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization
• AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY
• An infeasible active-set QP-free algorithm for general nonlinear programming
• An improved infeasible SSLE method for constrained optimization without strict complementarity
• A nonmonotone sequential systems of linear equations algorithm

Describes a project that uses

Uses Software

• COPS

This page was built for publication: An infeasible nonmonotone SSLE algorithm for nonlinear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379186)