Multiplier and gradient methods
From MaRDI portal
Publication:2532546
DOI10.1007/BF00927673zbMath0174.20705WikidataQ90650288 ScholiaQ90650288MaRDI QIDQ2532546
Publication date: 1969
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Newton's methodLagrange multipliermethod of conjugate gradientsgradient techniquesfinding unconstrained minimaminimum of a function subject to constraintsurvey of known methods
Related Items (only showing first 100 items - show all)
Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method ⋮ ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints ⋮ A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming ⋮ A constraint-space conjugate gradient method for function minimization and optimal control problems† ⋮ Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming ⋮ An Implementable Augmented Lagrangian Method for Solving Second-Order Cone Constrained Variational Inequalities ⋮ A golden ratio proximal alternating direction method of multipliers for separable convex optimization ⋮ Efficient learning rate adaptation based on hierarchical optimization approach ⋮ An adaptive sampling augmented Lagrangian method for stochastic optimization with deterministic constraints ⋮ Flexible multi-view semi-supervised learning with unified graph ⋮ Optimal control under nonconvexity: A generalized Hamiltonian approach ⋮ A shape optimization algorithm based on directional derivatives for three‐dimensional contact problems ⋮ A proximal fully parallel splitting method with a relaxation factor for separable convex programming ⋮ A variable projection method for large-scale inverse problems with \(\ell^1\) regularization ⋮ Transformed primal-dual methods for nonlinear saddle point systems ⋮ Integrating train service route design with passenger flow allocation for an urban rail transit line ⋮ Study on convex optimization with least constraint violation under a general measure ⋮ On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming ⋮ A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization ⋮ Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials ⋮ The augmented Lagrangian method can approximately solve convex optimization with least constraint violation ⋮ YAM2: yet another library for the \(M_2\) variables using sequential quadratic programming ⋮ Constrained composite optimization and augmented Lagrangian methods ⋮ A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees ⋮ Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization ⋮ An \(l_0\)-norm based color image deblurring model under mixed random-valued impulse and Gaussian noise ⋮ A linear algebra perspective on the random multi-block ADMM: the QP case ⋮ A revisit of Chen-Teboulle's proximal-based decomposition method ⋮ Approximate customized proximal point algorithms for separable convex optimization ⋮ An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression ⋮ Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming ⋮ Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques ⋮ Efficient Global Optimization of Two-Layer ReLU Networks: Quadratic-Time Algorithms and Adversarial Training ⋮ PCA Sparsified ⋮ Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming ⋮ Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization ⋮ Generalizations of the proximal method of multipliers in convex optimization ⋮ A relaxed proximal ADMM method for block separable convex programming ⋮ Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization ⋮ Strongly convergent inertial proximal point algorithm without on-line rule ⋮ An overview of nonlinear optimization ⋮ Unnamed Item ⋮ A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds ⋮ Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem ⋮ Study of variational inequality and equality formulations for elastostatic frictional contact problems ⋮ Median filtering‐based methods for static background extraction from surveillance video ⋮ An introduction to continuous optimization for imaging ⋮ Alternating Direction Method of Multipliers for Linear Inverse Problems ⋮ On second-order optimality conditions for nonlinear programming ⋮ On using exterior penalty approaches for solving linear programming problems ⋮ Space-decomposition multiplier method for constrained minimization problems ⋮ Local convergence of an augmented Lagrangian method for matrix inequality constrained programming ⋮ A new accuracy criterion for approximate proximal point algorithms ⋮ An augmented Lagrangian element-free (ALEF) approach for crack discontinuities. ⋮ The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent ⋮ Iteration-complexity of first-order augmented Lagrangian methods for convex programming ⋮ A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA ⋮ A distributed Douglas-Rachford splitting method for multi-block convex minimization problems ⋮ Computing over Unreliable Communication Networks ⋮ An Inexact Uzawa Algorithmic Framework for Nonlinear Saddle Point Problems with Applications to Elliptic Optimal Control Problem ⋮ A Splitting Augmented Lagrangian Method for Low Multilinear-Rank Tensor Recovery ⋮ A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem ⋮ Zero duality and saddle points of a class of augmented Lagrangian functions in constrained non-convex optimization ⋮ An Accelerated Linearized Alternating Direction Method of Multipliers ⋮ A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints ⋮ Augmented Lagrangian Method for Optimal Control Problems ⋮ Complexity and performance of an Augmented Lagrangian algorithm ⋮ The rate of convergence of proximal method of multipliers for nonlinear programming ⋮ The linearized alternating direction method of multipliers for low-rank and fused LASSO matrix regression model ⋮ On Alternating Direction Methods of Multipliers: A Historical Perspective ⋮ Application of the Alternating Direction Method of Multipliers to Control Constrained Parabolic Optimal Control Problems and Beyond ⋮ The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity ⋮ A class of nonlinear proximal point algorithms for variational inequality problems ⋮ On Optimality Conditions for Nonlinear Conic Programming ⋮ A proximal partially parallel splitting method for separable convex programs ⋮ An Error-Oriented Newton/Inexact Augmented Lagrangian Approach for Fully Monolithic Phase-Field Fracture Propagation ⋮ A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints ⋮ A primal-dual algorithm for risk minimization ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming ⋮ On the best achievable quality of limit points of augmented Lagrangian schemes ⋮ A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints ⋮ Perturbed augmented Lagrangian method framework with applications to proximal and smoothed variants ⋮ Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints ⋮ A parallel algorithm for constrained optimization problems ⋮ Augmented Lagrangian nonlinear programming algorithm that uses SQP and trust region techniques ⋮ The developments of proximal point algorithms ⋮ Augmented Lagrangian methods for convex matrix optimization problems ⋮ An investigation on semismooth Newton based augmented Lagrangian method for image restoration ⋮ The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems ⋮ Unconditional stability and long-term behavior of transient algorithms for the incompressible Navier-Stokes and Euler equations ⋮ On the formulation and theory of the Newton interior-point method for nonlinear programming ⋮ Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor ⋮ An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems ⋮ Saddle point and exact penalty representation for generalized proximal Lagrangians ⋮ On invariance and linear convergence of evolution strategies with augmented Lagrangian constraint handling ⋮ A genetic algorithm based augmented Lagrangian method for constrained optimization ⋮ tSSNALM: a fast two-stage semi-smooth Newton augmented Lagrangian method for sparse CCA ⋮ A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory ⋮ On the cost of solving augmented Lagrangian subproblems
Cites Work
- Unnamed Item
- Unnamed Item
- On a new computing technique in optimal control and its application to minimal-time flight profile optimization
- Properties of the conjugate-gradient and Davidon methods
- Iterative computational methods
- A Rapidly Convergent Descent Method for Minimization
- Davidon’s Method in Hilbert Space
- An Indirect Sufficiency Proof for the Problem of Bolza in Nonparametric Form
- Methods of conjugate gradients for solving linear systems
- On methods for obtaining solutions of fixed end-point problems in the calculus of variations
This page was built for publication: Multiplier and gradient methods
