A dual algorithm for the solution of nonlinear variational problems via finite element approximation

DOI10.1016/0898-1221(76)90003-1zbMath0352.65034OpenAlexW2045079045WikidataQ127202896 ScholiaQ127202896MaRDI QIDQ1235959

Daniel Gabay, Bertrand Mercier

Publication date: 1976

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(76)90003-1

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Variational methods applied to PDEs (35A15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Optimality conditions for minimax problems (49K35)

Related Items (only showing first 100 items - show all)

A new parallel splitting augmented Lagrangian-based method for a Stackelberg game ⋮ A hybrid optimization method for multiplicative noise and blur removal ⋮ Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization ⋮ Convergence analysis on a modified generalized alternating direction method of multipliers ⋮ Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming ⋮ Higher-degree eigenvalue complementarity problems for tensors ⋮ Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization ⋮ A parallel Gauss-Seidel method for convex problems with separable structure ⋮ Image restoration: a wavelet frame based model for piecewise smooth functions and beyond ⋮ New descent LQP alternating direction methods for solving a class of structured variational inequalities ⋮ Bounding duality gap for separable problems with linear constraints ⋮ Accelerated proximal algorithms with a correction term for monotone inclusions ⋮ Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints ⋮ An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem ⋮ An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems ⋮ A descent LQP alternating direction method for solving variational inequality problems with separable structure ⋮ Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing ⋮ A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces ⋮ On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions ⋮ Conic optimization via operator splitting and homogeneous self-dual embedding ⋮ Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities ⋮ Decomposition approaches for constrained spatial auction market problems ⋮ Convergence rates with inexact non-expansive operators ⋮ An algorithm twisted from generalized ADMM for multi-block separable convex minimization models ⋮ On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models ⋮ An inexact LQP alternating direction method for solving a class of structured variational inequalities ⋮ A multiphase image segmentation based on fuzzy membership functions and L1-norm fidelity ⋮ An alternating direction method for second-order conic programming ⋮ A coupled total variation model with curvature driven for image colorization ⋮ On the \(O(1/t)\) convergence rate of the alternating direction method with LQP regularization for solving structured variational inequality problems ⋮ A reliability-based stochastic traffic assignment model for network with multiple user classes under uncertainty in demand ⋮ Fast alternating linearization methods for minimizing the sum of two convex functions ⋮ An extended alternating direction method for variational inequality problems with linear equality and inequality constraints ⋮ A new parallel splitting descent method for structured variational inequalities ⋮ A parallel splitting method for separable convex programs ⋮ A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs ⋮ Augmented Lagrangian methods for transport optimization, mean field games and degenerate elliptic equations ⋮ A fast splitting method tailored for Dantzig selector ⋮ On the sublinear convergence rate of multi-block ADMM ⋮ Operator splittings, Bregman methods and frame shrinkage in image processing ⋮ A new decomposition method for variational inequalities with linear constraints ⋮ Smoothed state estimates under abrupt changes using sum-of-norms regularization ⋮ Fast minimization methods for solving constrained total-variation superresolution image reconstruction ⋮ Modified Lagrangian methods for separable optimization problems ⋮ An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures ⋮ Robust least square semidefinite programming with applications ⋮ An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints ⋮ A new alternating direction method for solving variational inequalities ⋮ Alternating direction method for bi-quadratic programming ⋮ Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization ⋮ A class of linearized proximal alternating direction methods ⋮ Variational image segmentation models involving non-smooth data-fidelity terms ⋮ A phase model for point spread function estimation in ground-based astronomy ⋮ On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure ⋮ Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing ⋮ An inexact alternating direction method for structured variational inequalities ⋮ Proximal-based pre-correction decomposition methods for structured convex minimization problems ⋮ Analysis of convergence for the alternating direction method applied to joint sparse recovery ⋮ An adaptive augmented Lagrangian method for large-scale constrained optimization ⋮ An augmented Lagrangian method for distributed optimization ⋮ Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization ⋮ On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm ⋮ A partial proximal point algorithm for nuclear norm regularized matrix least squares problems ⋮ A new alternating direction method for linearly constrained nonconvex optimization problems ⋮ The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization ⋮ On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers ⋮ An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming ⋮ A note on the convergence of ADMM for linearly constrained convex optimization problems ⋮ Comparison of several fast algorithms for projection onto an ellipsoid ⋮ A three-operator splitting scheme and its optimization applications ⋮ Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications ⋮ On the linear convergence of the alternating direction method of multipliers ⋮ Stability and performance verification of optimization-based controllers ⋮ An inexact alternating direction method of multipliers with relative error criteria ⋮ Mean field type control with congestion. II: An augmented Lagrangian method ⋮ Remarks on the generalized Newton method ⋮ A note on the convergence of alternating proximal gradient method ⋮ A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming ⋮ An alternating direction algorithm for matrix completion with nonnegative factors ⋮ An efficient simultaneous method for the constrained multiple-sets split feasibility problem ⋮ An improved proximal alternating direction method for monotone variational inequalities with separable structure ⋮ OSQP: An Operator Splitting Solver for Quadratic Programs ⋮ A class of ADMM-based algorithms for three-block separable convex programming ⋮ Alternating direction method of multipliers with difference of convex functions ⋮ Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization ⋮ A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems ⋮ Lagrangian penalization scheme with parallel forward-backward splitting ⋮ Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers ⋮ An efficient finite element solution using a large pre-solved regular element ⋮ On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints ⋮ Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach ⋮ On the convergence rate of Douglas-Rachford operator splitting method ⋮ Auxiliary problem principle and decomposition of optimization problems ⋮ Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization ⋮ Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization ⋮ Rank minimization with applications to image noise removal ⋮ Convergence study of indefinite proximal ADMM with a relaxation factor ⋮ Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm ⋮ Convergence analysis of L-ADMM for multi-block linear-constrained separable convex minimization problem ⋮ A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

Cites Work

• Multiplier and gradient methods
• An approach to nonlinear programming
• The multiplier method of Hestenes and Powell applied to convex programming
• On the method of multipliers for convex programming
• Combined Primal–Dual and Penalty Methods for Convex Programming
• Sur des méthodes d'optimisation par relaxation
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• Proximité et dualité dans un espace hilbertien
• Variational methods in the theory of the fluidity of a viscous-plastic medium
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A dual algorithm for the solution of nonlinear variational problems via finite element approximation