Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
From MaRDI portal
Publication:4136969
DOI10.1007/BF01580366zbMath0362.90103OpenAlexW2030184503MaRDI QIDQ4136969
Ubaldo M. García-Palomares, Olvi L. Mangasarian
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580366
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Newton-type methods (49M15)
Related Items
Variations and extension of the convex-concave procedure, Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems, A projected Newton method for minimization problems with nonlinear inequality constraints, Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems, A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence, Iterative linear programming solution of convex programs, A parallel inexact Newton method for stochastic programs with recourse, A robust secant method for optimization problems with inequality constraints, YAM2: yet another library for the \(M_2\) variables using sequential quadratic programming, Enlarging the region of convergence of Newton's method for constrained optimization, On-line optimization of gas pipeline networks, A recursive quadratic programming algorithm for semi-infinite optimization problems, An algorithm for solving linearly constrained minimax problems, Partitioned quasi-Newton methods for nonlinear equality constrained optimization, Superlinearly convergent variable metric algorithms for general nonlinear programming problems, Exact penalty functions in nonlinear programming, A globally convergent method for nonlinear programming, Algorithms for nonlinear constraints that use lagrangian functions, Iterative bundle-based decomposition for large-scale nonseparable convex optimization, Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences, A sequential quadratic programming method for constrained multi-objective optimization problems, Some examples of cycling in variable metric methods for constrained minimization, Computational methods for optimum design of large complex systems, A robust sequential quadratic programming method, The linearization method, 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, A method of centers algorithm for certain minimax problems, A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function, A globally and superlinearly convergent feasible QP-free method for nonlinear programming, Convergent stepsizes for constrained optimization algorithms, A globally convergent algorithm for nonlinearly constrained optimization problems, Interior proximal point algorithm for linear programs, Equality and inequality constrained optimization algorithms with convergent stepsizes, Gauss-Newton methods for the complementarity problem, A dual differentiable exact penalty function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible conjugate direction method to solve linearly constrained minimization problems
- An effective algorithm for minimization
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- On the Numerical Solution of Constrained Least-Squares Problems
- Penalty function versus non-penalty function methods for constrained nonlinear programming problems
- A quadratically-convergent algorithm for general nonlinear programming problems
