Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
From MaRDI portal
Publication:4136969
Cites work
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3312380 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A feasible conjugate direction method to solve linearly constrained minimization problems
- A quadratically-convergent algorithm for general nonlinear programming problems
- An effective algorithm for minimization
- On the Numerical Solution of Constrained Least-Squares Problems
- Penalty function versus non-penalty function methods for constrained nonlinear programming problems
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
Cited in
(36)- Iterative bundle-based decomposition for large-scale nonseparable convex optimization
- Some examples of cycling in variable metric methods for constrained minimization
- Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- Variations and extension of the convex-concave procedure
- A robust sequential quadratic programming method
- Equality and inequality constrained optimization algorithms with convergent stepsizes
- A method of centers algorithm for certain minimax problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Iterative linear programming solution of convex programs
- On-line optimization of gas pipeline networks
- A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function
- Algorithms for nonlinear constraints that use lagrangian functions
- Enlarging the region of convergence of Newton's method for constrained optimization
- Interior proximal point algorithm for linear programs
- Partitioned quasi-Newton methods for nonlinear equality constrained optimization
- A recursive quadratic programming algorithm for semi-infinite optimization problems
- The linearization method
- A globally convergent method for nonlinear programming
- Computational methods for optimum design of large complex systems
- Exact penalty functions in nonlinear programming
- 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 globally and superlinearly convergent feasible QP-free method for nonlinear programming
- A robust secant method for optimization problems with inequality constraints
- YAM2: yet another library for the \(M_2\) variables using sequential quadratic programming
- A sequential quadratic programming method for constrained multi-objective optimization problems
- A projected Newton method for minimization problems with nonlinear inequality constraints
- A globally convergent algorithm for nonlinearly constrained optimization problems
- A parallel inexact Newton method for stochastic programs with recourse
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Convergent stepsizes for constrained optimization algorithms
- Gauss-Newton methods for the complementarity problem
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- An algorithm for solving linearly constrained minimax problems
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
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)
