A new method for the optimization of a nonlinear function subject to nonlinear constraints
From MaRDI portal
Publication:5591123
DOI10.1093/comjnl/13.2.178zbMath0195.17403OpenAlexW2130839351MaRDI QIDQ5591123
Publication date: 1970
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/13.2.178
Related Items
SENSITIVITY ANALYSIS FORMULATION FOR THREE-DIMENSIONAL CONDUCTION HEAT TRANSFER WITH COMPLEX GEOMETRIES USING A BOUNDARY ELEMENT METHOD, Dual coordinate ascent methods for non-strictly convex minimization, Duality in nonlinear programs using augmented Lagrangian functions, MULTISYMPLECTIC VARIATIONAL INTEGRATORS FOR NONSMOOTH LAGRANGIAN CONTINUUM MECHANICS, Analysis, parameter estimation and optimal control of non-linear systems via general orthogonal polynomials, Decomposition Methods Based on Augmented Lagrangians: A Survey, Second order algorithms for the posynomial geometric programming dual, part I: Analysis, A constraint-space conjugate gradient method for function minimization and optimal control problems†, Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming, Abstract study of optimality conditions, New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization, A comparative performance evaluation of 27 nonlinear programming codes, A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints, Feasible directions algorithms for optimization problems with equality and inequality constraints, A numerical study of augmented penalty function algorithms for terminally constrained optimal control problems, A numerical study of multiplier methods for constrained parameter optimization, Multiplier methods: A survey, An accelerated multiplier method for nonlinear programming, An economical method of calculating Lagrange multiplier estimates for nonlinear programming problems when many of the constraints are bounds on the variables, A multiplier method with automatic limitation of penalty growth, Diagonalized multiplier methods and quasi-Newton methods for constrained optimization, Nonlinear leastpth optimization and nonlinear programming, Minimization methods with constraints, Accelerated convergence for the Powell/Hestenes multiplier method, Nonlinear programming methods in the presence of noise, Comparison of generalized geometric programming algorithms, A second-order method for the general nonlinear programming problem, Local convergence of the diagonalized method of multipliers, Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence, Perturbation lemma for the Newton method with application to the SQP Newton method, Use of the augmented penalty function in mathematical programming problems. II. Conjugate gradient-restoration algorithm, An augmented Lagrangian decomposition method for block diagonal linear programming problems, A numerical study of multiplier methods for constrained parameter optimization, The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity, A dual approach to solving nonlinear programming problems by unconstrained optimization, A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems, Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
