Algorithms for nonlinear constraints that use lagrangian functions

DOI10.1007/BF01588967zbMath0383.90092OpenAlexW2025469203MaRDI QIDQ4162980

M. J. D. Powell

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01588967

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization, Testing for separable functional structure using temporary equilibrium models, An approach to multi-start clustering for global optimization with non-linear constraints, SOME ASPECTS OF OPTIMUM DESIGN OF ELECTROMAGNETIC DEVICES, Experiments with successive quadratic programming algorithms, Dual techniques for constrained optimization, Estimating and testing generalized linear models under inequality restrictions, Scaling damped limited-memory updates for unconstrained optimization, Quasi-Newton methods for machine learning: forget the past, just sample, Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization, Damped techniques for enforcing convergence of quasi-Newton methods, Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems, An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization, A globally convergent version of a general recursive algorithm for nonlinear programming, Image space approach to penalty methods, NURBS-enhanced line integration BEM for thermo-elastic problems considering the gravity load, Structural analysis and optimization in the framework of reduced-basis method, A factorization with update procedures for a KKT matrix arising in direct optimal control, An augmented Lagrangian trust region method for equality constrained optimization, A two-stage feasible directions algorithm for nonlinear constrained optimization, Numerical performance of two formulations of truss topology optimization, A model-free shrinking-dimer saddle dynamics for finding saddle point and solution landscape, Transformed primal-dual methods for nonlinear saddle point systems, A hybrid differential dynamic programming algorithm for constrained optimal control problems. II: Application, An overview of stochastic quasi-Newton methods for large-scale machine learning, A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem., YAM2: yet another library for the \(M_2\) variables using sequential quadratic programming, An SQP-based multiple shooting algorithm for large-scale PDE-constrained optimal control problems, A globally convergent, implementable multiplier method with automatic penalty limitation, Proximal quasi-Newton method for composite optimization over the Stiefel manifold, Consistent approximations in composite optimization, Solving nonlinear programming problems with very many constraints, Enlarging the region of convergence of Newton's method for constrained optimization, Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming, Switching stepsize strategies for sequential quadratic programming, Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms, Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition, The dynamic-Q optimization method: an alternative to SQP?, A combined class of self-scaling and modified quasi-Newton methods, An augmented Lagrangian filter method, A simple alternating direction method for the conic trust region subproblem, A survey of gradient methods for solving nonlinear optimization, Gradient-free strategies to robust well control optimization, Decreasing the sensitivity of open-loop optimal solutions in decision making under uncertainty, A general system for heuristic minimization of convex functions over non-convex sets, Multi-level iterations for economic nonlinear model predictive control, The first open channel for yield-stress fluids in porous media, Block BFGS Methods, Exploiting damped techniques for nonlinear conjugate gradient methods, Damped techniques for the limited memory BFGS method for large-scale optimization, A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization, On the local and global convergence of a reduced Quasi-Newton method¹, Structural optimization strategies for simple and integrally stiffened plates and shells, Sequential quadratic programming with a flexible step acceptance strategy, Nonlinear modal analysis of mechanical systems with frictionless contact interfaces, Essential issues on solving optimal power flow problems using soft-computing, Minimum cost trajectory planning for industrial robots, Stochastic proximal quasi-Newton methods for non-convex composite optimization, ADAPTIVE-IMPROVED GENETIC ALGORITHM FOR THE ECONOMIC DISPATCH OF UNITS WITH MULTIPLE FUEL OPTIONS, Constrained optimization based F. E. mesh deforming algorithm for unconfined seepage problems, A Mixture Model for Occupational Exposure Mean Testing with a Limit of Detection, A robust multi-batch L-BFGS method for machine learning, Some examples of cycling in variable metric methods for constrained minimization, Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method, Quasi-Newtonian methods of constrained optimization, Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions, A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem, Computational methods for optimum design of large complex systems, Some improved projected quasi-Newton algorithms and their convergence. II: Local convergence rate and numerical tests, A robust sequential quadratic programming method, A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method, The linearization method, A new type of quasi-Newton updating formulas based on the new quasi-Newton equation, A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function, Constrained linear quadratic Gaussian control with process applications, A comparison of distributed MPC schemes on a hydro‐power plant benchmark, A new alternating direction trust region method based on conic model for solving unconstrained optimization, An algorithm for composite nonsmooth optimization problems, A primal-dual Newton-type algorithm for geometric programs with equality constraints, A quadratic approximation method for minimizing a class of quasidifferentiable functions, A non-linear programming approach to the computer-aided design of regulators using a linear-quadratic formulation†, High-Order Optimization Methods for Fully Composite Problems, A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiplier methods: A survey
• Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
• Multiplier and gradient methods
• An alternate implementation of Goldfarb's minimization algorithm
• An Ideal Penalty Function for Constrained Optimization
• Quasi-Newton Methods, Motivation and Theory
• Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• The Convergence of a Class of Double-rank Minimization Algorithms
• A new approach to variable metric algorithms
• A quadratically-convergent algorithm for general nonlinear programming problems