Partitioned quasi-Newton methods for nonlinear equality constrained optimization
Numerical computation of solutions to systems of equations (65H10) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Quadratic programming (90C20) Nonlinear programming (90C30)
New methods as described in the title are derived in this paper. The new updates maintain definiteness on the null space of the matrix of active gradients and satisfy a minimum change condition. Numerical details are discussed with resports of numerical experiments.
- Partitioned quasi-Newton methods for sparse nonlinear equations
- scientific article; zbMATH DE number 3934787
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- Quasi-Newton methods for solving nonlinear programming problems
- Least-change quasi-Newton updates for equality-constrained optimization
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- A surperlinearly convergent algorithm for constrained optimization problems
- An algorithm for composite nonsmooth optimization problems
- Definite and Semidefinite Quadratic Forms
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- scientific article; zbMATH DE number 3943568 (Why is no real title available?)
- scientific article; zbMATH DE number 3736490 (Why is no real title available?)
- scientific article; zbMATH DE number 3768469 (Why is no real title available?)
- scientific article; zbMATH DE number 3800875 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 3302906 (Why is no real title available?)
- scientific article; zbMATH DE number 3309656 (Why is no real title available?)
- scientific article; zbMATH DE number 3422206 (Why is no real title available?)
- Least Change Secant Updates for Quasi-Newton Methods
- Local Convergence of Secant Methods for Nonlinear Constrained Optimization
- Methods for Modifying Matrix Factorizations
- Minimization of functions having Lipschitz continuous first partial derivatives
- Multiplier and gradient methods
- Newton-type methods for unconstrained and linearly constrained optimization
- On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
- Partitioned quasi-Newton methods for nonlinear equality constrained optimization
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- Properties of updating methods for the multipliers in augmented Lagrangians
- Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
- Sequential Quadratic Programming Methods Based on Approximating a Projected Hessian Matrix
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Test examples for nonlinear programming codes
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
- Optimality tests for partitioning and sectional search algorithms
- Partitioned quasi-Newton methods for nonlinear equality constrained optimization
- An SQP method for general nonlinear programs using only equality constrained subproblems
- An H-form variant of the partitioned QN method
- An analysis of reduced Hessian methods for constrained optimization
- Partitioned quasi-Newton methods for sparse nonlinear equations
This page was built for publication: Partitioned quasi-Newton methods for nonlinear equality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184335)
