The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
From MaRDI portal
(Redirected from Publication:790580)
Recommendations
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems
- A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems
- An exact augmented Lagrangian function for nonlinear programming problems with inequality constraints
- On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming
- An exact augmented Lagrangian function for nonlinear programming with two-sided con\-straints
- Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints
- On the convergence of augmented Lagrangian strategies for nonlinear programming
- Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming
- scientific article; zbMATH DE number 1552021
- Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers
Cites work
- scientific article; zbMATH DE number 3848109 (Why is no real title available?)
- scientific article; zbMATH DE number 3684824 (Why is no real title available?)
- scientific article; zbMATH DE number 3727523 (Why is no real title available?)
- scientific article; zbMATH DE number 3772425 (Why is no real title available?)
- scientific article; zbMATH DE number 3436540 (Why is no real title available?)
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3382096 (Why is no real title available?)
- A General Quadratic Programming Algorithm
- A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
- A globally convergent method for nonlinear programming
- An Adaptive Precision Method for Nonlinear Optimization Problems
- Methods for Computing and Modifying the LDV Factors of a Matrix
- Minimization of functions having Lipschitz continuous first partial derivatives
- Nonlinear programming codes. Information, tests, performance
- On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming
- Some examples of cycling in variable metric methods for constrained minimization
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Test examples for nonlinear programming codes
Cited in
(47)- scientific article; zbMATH DE number 1487433 (Why is no real title available?)
- A nonmonotone trust-region algorithm with nonmonotone penalty parameters for constrained optimization
- A robust sequential quadratic programming method
- Equality and inequality constrained optimization algorithms with convergent stepsizes
- Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds
- A nonlinear preconditioner for optimum experimental design problems
- Partitioned quasi-Newton methods for nonlinear equality constrained optimization
- A trust region algorithm for equality constrained optimization
- scientific article; zbMATH DE number 3984693 (Why is no real title available?)
- A primal-dual augmented Lagrangian
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function
- Modeling and computation of shakedown problems for nonlinear hardening materials
- Algebraic multigrid methods based on element preconditioning
- A successive quadratic programming method that uses new corrections for search directions
- New sequential quadratic programming algorithm with consistent subproblems
- Direct shooting method for the numerical solution of higher-index DAE optimal control problems
- Application of sequential quadratic programming software program to an actual problem
- A globally convergent trust region algorithm for optimization with general constraints and simple bounds.
- Computational methods for optimum design of large complex systems
- A sequential quadratic programming method for potentially infeasible mathematical programs
- Eine global and lokal überlineare knovergente regularisierung des wilson-vergahrens
- A globally convergent version of a general recursive algorithm for nonlinear programming
- A variant of SQP method for inequality constrained optimization and its global convergence
- An algorithm for deconvolution by the maximum entropy method with astronomical applications
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
- scientific article; zbMATH DE number 16507 (Why is no real title available?)
- An SQP method for general nonlinear programs using only equality constrained subproblems
- Estimating and testing generalized linear models under inequality restrictions
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems
- A unified approach for parameter identification of inelastic material models in the frame of the finite element method
- A globally convergent algorithm for nonlinearly constrained optimization problems
- Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems.
- Recent developments in constrained optimization
- Separation process optimization calculations
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
- A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization
- Algorithm for solving NLP problems with the use of a modified Lagrange function
- Algorithm for solving NLP problems with the use of a modified Lagrange function
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- Time domain constrained \(H_{\infty }\)-synthesis
- A new penalty-free-type algorithm based on trust region techniques
- A special newton-type optimization method
- The kidney model as an inverse problem
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
- Identifying the mixed and forced convection flow with transverse magnetic field
- A basis reduction method using proper orthogonal decomposition for shakedown analysis of kinematic hardening material
This page was built for publication: The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790580)
