The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
From MaRDI portal
Publication:790580
DOI10.1007/BF01395810zbMath0534.65030OpenAlexW344808587MaRDI QIDQ790580
Publication date: 1981
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132750
convergence analysispenalty functionaugmented Lagrange functionline search computationquadratic approximation methods
Related Items
A nonmonotone trust-region algorithm with nonmonotone penalty parameters for constrained optimization, Estimating and testing generalized linear models under inequality restrictions, Separation process optimization calculations, Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds, A sequential quadratic programming method for potentially infeasible mathematical programs, A recursive quadratic programming algorithm that uses differentiable exact penalty functions, Recent developments in constrained optimization, New sequential quadratic programming algorithm with consistent subproblems, A globally convergent version of a general recursive algorithm for nonlinear programming, A unified approach for parameter identification of inelastic material models in the frame of the finite element method, Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints, Eine global and lokal überlineare knovergente regularisierung des wilson-vergahrens, A successive quadratic programming method that uses new corrections for search directions, A new penalty-free-type algorithm based on trust region techniques, A special newton-type optimization method, A variant of SQP method for inequality constrained optimization and its global convergence, Direct shooting method for the numerical solution of higher-index DAE optimal control problems, A primal-dual augmented Lagrangian, Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems., Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function, Unnamed Item, A trust region algorithm for equality constrained optimization, Partitioned quasi-Newton methods for nonlinear equality constrained optimization, An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems, An algorithm for deconvolution by the maximum entropy method with astronomical applications, A basis reduction method using proper orthogonal decomposition for shakedown analysis of kinematic hardening material, Modeling and computation of shakedown problems for nonlinear hardening materials, An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity, A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity, A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization, Algebraic multigrid methods based on element preconditioning, A nonlinear preconditioner for optimum experimental design problems, Time domain constrained H ∞ -synthesis, Unnamed Item, Computational methods for optimum design of large complex systems, A robust sequential quadratic programming method, An SQP method for general nonlinear programs using only equality constrained subproblems, 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, A globally convergent trust region algorithm for optimization with general constraints and simple bounds., The kidney model as an inverse problem, Application of sequential quadratic programming software program to an actual problem, A globally convergent algorithm for nonlinearly constrained optimization problems, Equality and inequality constrained optimization algorithms with convergent stepsizes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear programming codes. Information, tests, performance
- Test examples for nonlinear programming codes
- A globally convergent method for nonlinear programming
- A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
- Minimization of functions having Lipschitz continuous first partial derivatives
- Methods for Computing and Modifying the LDV Factors of a Matrix
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming
- An Adaptive Precision Method for Nonlinear Optimization Problems
- Some examples of cycling in variable metric methods for constrained minimization
- A General Quadratic Programming Algorithm
