On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
From MaRDI portal
Cited in
(66)- On the local convergence of a penalty-function-free SQP method
- A projected Newton method for minimization problems with nonlinear inequality constraints
- A reduced Hessian SQP method for inequality constrained optimization
- A type of efficient feasible SQP algorithms for inequality constrained optimization
- An approximate Jacobian nonlinear solver for multiphase flow and transport
- Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization
- An efficient algorithm for a class of equality-constrained optimization problems
- Local properties of algorithms for minimizing nonsmooth composite functions
- A practical update criterion for SQP method
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
- A modified QP-free feasible method
- Perturbation lemma for the Newton method with application to the SQP Newton method
- A cautious BFGS update for reduced Hessian SQP
- Equality and inequality constrained optimization algorithms with convergent stepsizes
- A globally and superlinearly convergent feasible QP-free method for nonlinear programming
- A heuristic algorithm for nonlinear programming
- On Secant Updates for Use in General Constrained Optimization
- Secant algorithms with nonmonotone trust region that employs fletcher penalty function for constrained optimization
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
- A superlinearly convergent numerical algorithm for nonlinear programming
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- A quasi-Newton modified LP-Newton method
- An efficiently implementable Gauss-Newton-like method for solving singular nonlinear equations
- A trust region algorithm for equality constrained optimization
- Local feasible QP-free algorithms for the constrained minimization of SC^1 functions
- A successive quadratic programming algorithm with global and superlinear convergence properties
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- Superlinear convergence of an SQP-type method for nonlinear semidefinite programming
- A globally and superlinearly convergent modified SQP-filter method
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
- Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
- An example of irregular convergence in some constrained optimization methods that use the projected hessian
- Sequential penalty algorithm for nonlinear constrained optimization
- Convergence of a projected gradient method with trust region for nonlinear constrained optimization†
- On the local and global convergence of a reduced Quasi-Newton method1
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
- A modified SQP method and its global convergence
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms
- A modified SQP-filter method and its global convergence
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- An improved feasible QP-free algorithm for inequality constrained optimization
- A successive quadratic programming method that uses new corrections for search directions
- Unification of basic and composite nondifferentiable optimization
- Exploiting additional structure in equality constrained optimization by structured SQP secant algorithms
- Exact penalty function algorithm with simple updating of the penalty parameter
- Convergence of the BFGS-SQP Method for Degenerate Problems
- The strict superlinear order can be faster than the infinite order
- Local convergence of the interior-point Newton method for general nonlinear programming
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function
- Two-step and three-step Q-superlinear convergence of SQP methods
- A projected gradient and constraint linearization method for nonlinear model predictive control
- Convergent stepsizes for constrained optimization algorithms
- A class of superlinearly convergent projection algorithms with relaxed stepsizes
- New sequential quadratic programming algorithm with consistent subproblems
- A quasi-Newton strategy for the SSQP method for variational inequality and optimization problems
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
- Sequential quadratic programming for large-scale nonlinear optimization
- An infeasible active-set QP-free algorithm for general nonlinear programming
- Newton's method and secant methods: a longstanding relationship from vectors to matrices
- Multilevel least-change Newton-like methods for equality constrained optimization problems
- A constrained min-max algorithm for rival models of the same economic system
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
- The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization
This page was built for publication: On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3957866)
