A globally convergent, implementable multiplier method with automatic penalty limitation
From MaRDI portal
Publication:1145623
DOI10.1007/BF01442901zbMath0445.90070OpenAlexW1994181610MaRDI QIDQ1145623
Publication date: 1980
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01442901
rate of convergenceglobal convergencemultiplier methodspenalty function methodsautomatic penalty limitationconstrained nonconvex nonlinear programmingglobally convergent implementable multiplier methodpenalty limitationsequence of unconstrained optimizationsequential minimization type multiplier methods
Related Items
Decomposition Methods Based on Augmented Lagrangians: A Survey, A parallel algorithm for constrained optimization problems, The equations of the multi-phase humid atmosphere expressed as a quasi variational inequality, The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces, Mathematical analysis of a cloud resolving model including the ice microphysics, A constrained min-max algorithm for rival models of the same economic system, Preface, The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization, New dual-type decomposition algorithm for non-convex separable optimization problems, An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods, Convergent stepsizes for constrained optimization algorithms, Equality and inequality constrained optimization algorithms with convergent stepsizes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiplier methods: A survey
- On the convergence properties of second-order multiplier methods
- A second-order method for the general nonlinear programming problem
- Multiplier and gradient methods
- Algorithms for some minimax problems
- A multiplier method with automatic limitation of penalty growth
- Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem
- On Penalty and Multiplier Methods for Constrained Minimization
- An Ideal Penalty Function for Constrained Optimization
- A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
- Algorithms for nonlinear constraints that use lagrangian functions
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- The method of penalty estimates for conditional extremum problems
- Differentiability of a maximum function. I
- The Weierstrass E-Function in the Calculus of Variations
