Multiplier methods: A survey
From MaRDI portal
Publication:1223623
DOI10.1016/0005-1098(76)90077-7zbMath0321.49027OpenAlexW368078881MaRDI QIDQ1223623
Publication date: 1976
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0005-1098(76)90077-7
Related Items
Application of decomposition coordination methods to parameter identification problems in interconnected distributed parameter systems, On the convergence properties of a second-order augmented Lagrangian method for nonlinear programming problems with inequality constraints, A class of augmented Lagrangians for equality constraints in nonlinear programming problems, Mumford-Shah and Potts regularization for manifold-valued data, Perturbed augmented Lagrangian method framework with applications to proximal and smoothed variants, An inexact restoration strategy for the globalization of the sSQP method, Analysis of structural equation models with exact and stochastic constraints using a bayesian approach, Zero duality gap for a class of nonconvex optimization problems, Decomposition Methods Based on Augmented Lagrangians: A Survey, A distribution free approach for analysis of two-level structural equation model, A parameter-free multiplier method for constrained minimization problems, Lagrangian dual framework for conservative neural network solutions of kinetic equations, Instantaneous voiced/non-voiced detection in speech signals based on variational mode decomposition, Solving inequality constrained optimization problems by differential homotopy continuation methods, Tracking approach in hierarchical optimization of large-scale systems, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Exact augmented lagrangian approach to multilevel optimization of large-scale systems, Double-loop-iterative-tracking-algorithm-based direct coordination for hierarchical steady-state control of interconnected systems, The multiplier method for optimal control problems of parabolic systems, Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization, Physics and equality constrained artificial neural networks: application to forward and inverse problems with multi-fidelity data fusion, On the convergence of a generalized Reduced gradient algorithm for nonlinear programming problems, Algorithms for a class of nondifferentiable problems, Existence of optimal Lagrange multipliers for certain nonconvex allocation problems, Abstract study of optimality conditions, Investigating and Mitigating Failure Modes in Physics-Informed Neural Networks (PINNs), A globally convergent, implementable multiplier method with automatic penalty limitation, A new augmented Lagrangian function for inequality constraints in nonlinear programming problems, Two-dimensional compact variational mode decomposition, New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization, Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints, Approximation and regularization properties of augmented penalty functions in convex programming, The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces, Second-order multiplier iteration based on a class of nonlinear Lagrangians, Covariance structure analysis in several populations, Optimality tests for partitioning and sectional search algorithms, Estimation of structural equation models with exact and stochastic prior information, Non-smooth Variational Regularization for Processing Manifold-Valued Data, A distributed asynchronous method of multipliers for constrained nonconvex optimization, Constrained maximum likelihood estimation of two-level covariance structure model via EM type algorithms, The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming, A hierarchical approach to state space constrained optimization problems, Approximation procedures based on the method of multipliers, An infeasible method of large-system optimization by direct coordination of subsystem inputs, Approximating saddle points as equilibria of differential inclusions, Nonlinear programming methods in the presence of noise, On the convergence properties of second-order multiplier methods, Algorithms for nonlinear constraints that use lagrangian functions, New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints, Convexification procedures and decomposition methods for nonconvex optimization problems, A geometric method in nonlinear programming, Energy-optimal controls in the mammalian neuromuscular system, On the Convergence of a Regularization Scheme for Approximating Cavitation Solutions with Prescribed Cavity Volume, On coordination strategies for the interaction prediction principle using gradient and multiplier methods, On the convergence of inexact augmented Lagrangian methods for problems with convex constraints, Differential dynamic programming applied to continuous optimal control problems with state variable inequality constraints, An exact penalty function algorithm for solving general constrained parameter optimization problems, Value-estimation function method for constrained global optimization, Optimal constrained selection of a measurable subset, Auxiliary problem principle and decomposition of optimization problems, Further study on a class of augmented Lagrangians of Di Pillo and Grippo in nonlinear programming, A variable-penalty alternating directions method for convex optimization, A modified Newton method for constrained estimation in covariance structure analysis, Duality in mathematical programming of set functions: On Fenchel duality theorem, Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming, A primal-dual Newton-type algorithm for geometric programs with equality constraints, The multiplier method in constrained estimation of covariance structure models, Augmented Lagrangian algorithms for linear programming, Two-level solution algorithms for constrained dynamic optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation procedures based on the method of multipliers
- GP -- a C language implementation of genetic programming
- The auction algorithm: A distributed relaxation method for the assignment problem
- On the convergence of a numerical method for optimal control problems
- Multiplier and gradient methods
- Balance function for the optimal control problem
- Use of the augmented penalty function in mathematical programming problems. II. Conjugate gradient-restoration algorithm
- Constrained optimization problems using multiplier methods
- Use of the augmented penalty function in mathematical programming problems. I
- Approximation of the classical isoperimetric problem
- A method for solving a quadratic optimal control problems
- On the method of multipliers for mathematical programming problems
- An approach to nonlinear programming
- A new approach to constrained function optimization
- The multiplier method of Hestenes and Powell applied to convex programming
- Combined Primal-Dual and Penalty Methods for Constrained Minimization
- Unconstrained Lagrangians in Nonlinear Programming
- Multiplier method and optimal control problems with terminal state constraints
- On the method of multipliers for convex programming
- On Penalty and Multiplier Methods for Constrained Minimization
- Necessary and sufficient conditions for a penalty method to be exact
- Combined Primal–Dual and Penalty Methods for Convex Programming
- A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
- A general saddle point result for constrained optimization
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- The method of penalty estimates for conditional extremum problems
- A Nonlinear Optimal Control Minimization Technique
- Perturbations of Optimal Control Problems
- Difference Approximations in Optimal Control Problems
- Discrete Approximations to Continuous Optimal Control Problems
- A new method for the optimization of a nonlinear function subject to nonlinear constraints
- Finite-Dimensional Approximations of State-Constrained Continuous Optimal Control Problems
- An Adaptive Precision Gradient Method for Optimal Control
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- An explicit procedure for discretizing continuous, optimal control problems