Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems

Cites Work

On the Numerical Solution of Constrained Least-Squares Problems
Title not available (Why is that?)
Title not available (Why is that?)
A quadratically-convergent algorithm for general nonlinear programming problems
Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
A feasible conjugate direction method to solve linearly constrained minimization problems
Title not available (Why is that?)
An effective algorithm for minimization
Penalty function versus non-penalty function methods for constrained nonlinear programming problems

Cited In (36)

A projected Newton method for minimization problems with nonlinear inequality constraints
A parallel inexact Newton method for stochastic programs with recourse
Gauss-Newton methods for the complementarity problem
A robust sequential quadratic programming method
Partitioned quasi-Newton methods for nonlinear equality constrained optimization
Variations and extension of the convex-concave procedure
Algorithms for nonlinear constraints that use lagrangian functions
A recursive quadratic programming algorithm for semi-infinite optimization problems
Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
A method of centers algorithm for certain minimax problems
Equality and inequality constrained optimization algorithms with convergent stepsizes
A globally and superlinearly convergent feasible QP-free method for nonlinear programming
A globally convergent method for nonlinear programming
A globally convergent algorithm for nonlinearly constrained optimization problems
Iterative linear programming solution of convex programs
A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function
A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence
A dual differentiable exact penalty function
A sequential quadratic programming method for constrained multi-objective optimization problems
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Enlarging the region of convergence of Newton's method for constrained optimization
Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
An algorithm for solving linearly constrained minimax problems
Computational methods for optimum design of large complex systems
Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
YAM2: yet another library for the \(M_2\) variables using sequential quadratic programming
Interior proximal point algorithm for linear programs
Iterative bundle-based decomposition for large-scale nonseparable convex optimization
Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
On-line optimization of gas pipeline networks
Convergent stepsizes for constrained optimization algorithms
A robust secant method for optimization problems with inequality constraints
Exact penalty functions in nonlinear programming
Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs
The linearization method
Some examples of cycling in variable metric methods for constrained minimization

This page was built for publication: Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems

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