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

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

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

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, Data parallel computing for network-structured optimization problems, A modified augmented Lagrangian method for a class of monotone variational inequalities, A proximal-based deomposition method for compositions method for convex minimization problems, Linearized alternating direction method of multipliers for sparse group and fused Lasso models, An efficient algorithm for batch images alignment with adaptive rank-correction term, Hybrid discretization methods with adaptive yield surface detection for Bingham pipe flows, Variational methods for normal integration, A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis, Alternating direction method for generalized Sylvester matrix equation $AXB + CYD = E$, Speckle noise removal in ultrasound images by first- and second-order total variation, An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems, Spatially dependent regularization parameter selection for total generalized variation-based image denoising, Sparse approximate solution of fitting surface to scattered points by MLASSO model, Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription, Alternating direction method of multipliers for separable convex optimization of real functions in complex variables, A regularized semi-smooth Newton method with projection steps for composite convex programs, A partially isochronous splitting algorithm for three-block separable convex minimization problems, The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem, Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm, On the emergence of oscillations in distributed resource allocation, On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities, TILT: transform invariant low-rank textures, Tight global linear convergence rate bounds for Douglas-Rachford splitting, Preconditioned Douglas-Rachford algorithms for TV- and TGV-regularized variational imaging problems, Numerical methods for parameter estimation in Poisson data inversion, An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems, The matrix splitting based proximal fixed-point algorithms for quadratically constrained $\ell_{1}$ minimization and Dantzig selector, An alternating direction and projection algorithm for structure-enforced matrix factorization, A note on the alternating direction method of multipliers, A first-order block-decomposition method for solving two-easy-block structured semidefinite programs, A proximal alternating linearization method for minimizing the sum of two convex functions, A partially parallel prediction-correction splitting method for convex optimization problems with separable structure, Convergence of ADMM for multi-block nonconvex separable optimization models, Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems, Image restoration based on the hybrid total-variation-type model, An augmented Lagrangian-based parallel splitting method for a one-leader-two-follower game, Split Bregman method for large scale fused Lasso, A variational formulation for physical noised image segmentation, Optimal matrix pencil approximation problem in structural dynamic model updating, Duality methods for solving variational inequalities, X-ray CT image reconstruction via wavelet frame based regularization and Radon domain inpainting, An efficient algorithm for $\ell_{0}$ minimization in wavelet frame based image restoration, Primal and dual alternating direction algorithms for $\ell _{1}$-$\ell _{1}$-norm minimization problems in compressive sensing, An ADM-based splitting method for separable convex programming, Alternating direction method for structure-persevering finite element model updating problem, Improved susceptibility artifact correction of echo-planar MRI using the alternating direction method of multipliers, New decomposition methods for solving variational inequality problems., A flexible ADMM algorithm for big data applications, Parallel multi-block ADMM with $o(1/k)$ convergence, A proximal decomposition algorithm for variational inequality problems., Two proposals for robust PCA using semidefinite programming, Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations, Least absolute deviations learning of multiple tasks, Linearized block-wise alternating direction method of multipliers for multiple-block convex programming, Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights, A simple alternating direction method for the conic trust region subproblem, Image restoration by a mixed high-order total variation and $l_1$ regularization model, Decomposition method for a class of monotone variational inequality problems, Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem, On Glowinski's open question on the alternating direction method of multipliers, Envelope functions: unifications and further properties, A new descent alternating direction method with LQP regularization for the structured variational inequalities, A modified alternating direction method for convex minimization problems, A nonstationary accelerating alternating direction method for frame-based Poissonian image deblurring, Alternating iterative methods for solving tensor equations with applications, Global convergence of ADMM in nonconvex nonsmooth optimization, Electrical networks with prescribed current and applications to random walks on graphs, An improved proximal-based decomposition method for structured monotone variational inequalities, Level-set methods for convex optimization, Distributed optimization and control with ALADIN, A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming, Cauchy noise removal by nonconvex ADMM with convergence guarantees, Linear convergence rates for variants of the alternating direction method of multipliers in smooth cases, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization, Application of the alternating direction method of multipliers to separable convex programming problems, On inexact ADMMs with relative error criteria, An FE-inexact heterogeneous ADMM for elliptic optimal control problems with $L^1$-control cost, A new alternating direction method for co-coercive variational inequality problems, New parallel descent-like method for solving a class of variational inequalities, A new primal-dual algorithm for minimizing the sum of three functions with a linear operator, Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming, Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming, Numerical solution of two-dimensional magnetostatic problems by augmented lagrangian methods, Removing multiplicative noise by Douglas-Rachford splitting methods, Variable splitting based method for image restoration with impulse plus Gaussian noise, LED-based photometric stereo: modeling, calibration and numerical solution, Priors with coupled first and second order differences for manifold-valued image processing, Symmetric Gauss-Seidel technique-based alternating direction methods of multipliers for transform invariant low-rank textures problem, Robust visual tracking via consistent low-rank sparse learning, Sparse illumination learning and transfer for single-sample face recognition with image corruption and misalignment, A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems, A variable-penalty alternating directions method for convex optimization, Some numerical methods in elastoplasticity, Solving a class of asymmetric variational inequalities by a new alternating direction method, Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities, Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities, New alternating direction method for a class of nonlinear variational inequality problems, Parallel alternating direction multiplier decomposition of convex programs, A new stepsize rule in He and Zhou's alternating direction method, Penalized and constrained LAD estimation in fixed and high dimension, On decomposition and multiobjective-based column and disjunctive cut generation for MINLP, Subgroup-effects models for the analysis of personal treatment effects, 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, Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm, A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints, A new hybrid regularization scheme for removing salt and pepper noise, An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization, Proportional-integral projected gradient method for conic optimization, A tailor-made 3-dimensional directional Haar semi-tight framelet for pMRI reconstruction, The developments of proximal point algorithms, Inertial alternating direction method of multipliers for non-convex non-smooth optimization, Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor, Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm, An ADMM algorithm for two-stage stochastic programming problems, A nonconvex $l_1 (l_1-l_2)$ model for image restoration with impulse noise, Saturation-value total variation model for chromatic aberration correction, A new interpretation of the progressive hedging algorithm for multistage stochastic minimization problems, An improved total variation regularized RPCA for moving object detection with dynamic background, Supervised distance preserving projection using alternating direction method of multipliers, An inexact proximal generalized alternating direction method of multipliers, On descent alternating direction method with LQP regularization for the structured variational inequalities, Baseline drift estimation for air quality data using quantile trend filtering, Image restoration via the adaptive $TV^p$ regularization, Efficient iterative solution of finite element discretized nonsmooth minimization problems, Generalized risk parity portfolio optimization: an ADMM approach, Convergence study on the proximal alternating direction method with larger step size, Image colorization by fusion of color transfers based on DFT and variance features, BayesProject: fast computation of a projection direction for multivariate changepoint detection, Non-blind and blind deconvolution under Poisson noise using fractional-order total variation, A review on deep learning in medical image reconstruction, On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming, An adaptive primal-dual framework for nonsmooth convex minimization, A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery, Bregman reweighted alternating minimization and its application to image deblurring, Fixing and extending some recent results on the ADMM algorithm, The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex, An inexact PAM method for computing Wasserstein barycenter with unknown supports, An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization, The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach, A generalized matrix Krylov subspace method for TV regularization, A proximal fully parallel splitting method for stable principal component pursuit, Sparse approximation of fitting surface by elastic net, Advanced algorithms for penalized quantile and composite quantile regression, A novel convex clustering method for high-dimensional data using semiproximal ADMM, Automatic prior shape selection for image edge detection with modified Mumford-Shah model, A simple and feasible method for a class of large-scale $l^1$-problems, A projection proximal-point algorithm for MR imaging using the hybrid regularization model, On the convergence analysis of the alternating direction method of multipliers with three blocks, MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems, A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming, The distance between convex sets with Minkowski sum structure: application to collision detection, Convergence rates for an inexact ADMM applied to separable convex optimization, A survey on conic relaxations of optimal power flow problem, A golden ratio primal-dual algorithm for structured convex optimization, Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems, An accelerated active-set algorithm for a quadratic semidefinite program with general constraints, Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms, A multi-level ADMM algorithm for elliptic PDE-constrained optimization problems, A dual symmetric Gauss-Seidel alternating direction method of multipliers for hyperspectral sparse unmixing, Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers, A study on distributed optimization over large-scale networked systems, Bilinear constraint based ADMM for mixed Poisson-Gaussian noise removal, Inductive matrix completion with feature selection, Double fused Lasso regularized regression with both matrix and vector valued predictors, Partially distributed outer approximation, An efficient Hessian based algorithm for singly linearly and box constrained least squares regression, Decomposition of longitudinal deformations via Beltrami descriptors, A parallel splitting ALM-based algorithm for separable convex programming, Nonsmooth exact penalization second-order methods for incompressible bi-viscous fluids, Image retinex based on the nonconvex TV-type regularization, Image restoration based on fractional-order model with decomposition: texture and cartoon, Fenchel duality theory and a primal-dual algorithm on Riemannian manifolds, A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization, Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix, A regularized alternating direction method of multipliers for a class of nonconvex problems, New strong convergence method for the sum of two maximal monotone operators, An ADMM-based SQP method for separably smooth nonconvex optimization, Two-stage geometric information guided image reconstruction, Alternating direction based method for optimal control problem constrained by Stokes equation, ADMM-type methods for generalized multi-facility Weber problem, Remove the salt and pepper noise based on the high order total variation and the nuclear norm regularization, Dualize, split, randomize: toward fast nonsmooth optimization algorithms, Convergence results of two-step inertial proximal point algorithm, An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications, An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems, Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization, Generalized opinion dynamics model for social trust networks, High-performance statistical computing in the computing environments of the 2020s, A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems, An adaptive alternating direction method of multipliers, Revisiting augmented Lagrangian duals, Automatic balancing parameter selection for Tikhonov-TV regularization, The $\ell_{2,p}$ regularized total variation with overlapping group sparsity prior for image restoration with impulse noise, Converting ADMM to a proximal gradient for efficient sparse estimation, Theoretical characteristics and numerical methods for a class of special piecewise quadratic optimization, An inexact ADMM with proximal-indefinite term and larger stepsize, An inexact accelerated stochastic ADMM for separable convex optimization, Computing the effective crack energy of heterogeneous and anisotropic microstructures via anisotropic minimal surfaces, Implicit surface reconstruction with total variation regularization, A proximal alternating direction method for $\ell_{2,1}$-norm least squares problem in multi-task feature learning, An alternating direction method of multipliers for elliptic equation constrained optimization problem, Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA, The symmetric ADMM with indefinite proximal regularization and its application, Sparse representation on graphs by tight wavelet frames and applications, Primal-dual algorithms for total variation based image restoration under Poisson noise, ADMM for monotone operators: convergence analysis and rates, Iteration-complexity analysis of a generalized alternating direction method of multipliers, On the global and linear convergence of the generalized alternating direction method of multipliers, LAVIR -- locally adaptive variational image registration, A multi-parameter regularization model for deblurring images corrupted by impulsive noise, Least gradient problems with Neumann boundary condition, Accelerated Bregman operator splitting with backtracking, A proximal point analysis of the preconditioned alternating direction method of multipliers, Rates of convergence for inexact Krasnosel'skii-Mann iterations in Banach spaces, A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems, Sparse wavelet estimation in quantile regression with multiple functional predictors, Alternating direction method of multipliers for nonconvex fused regression problems, Inexact alternating direction methods of multipliers for separable convex optimization, Projective method of multipliers for linearly constrained convex minimization, A nonconvex model with minimax concave penalty for image restoration, Block-wise ADMM with a relaxation factor for multiple-block convex programming, Partial convolution for total variation deblurring and denoising by new linearized alternating direction method of multipliers with extension step, $O(1/t)$ complexity analysis of the generalized alternating direction method of multipliers, A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming, Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization, A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems, Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization, Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems, A proximal point algorithm revisit on the alternating direction method of multipliers, A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints, An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems, Proximal alternating directions method for structured variational inequalities, A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit, A partially proximal S-ADMM for separable convex optimization with linear constraints, Benders decomposition for a class of variational inequalities, Generalized Peaceman-Rachford splitting method with substitution for convex programming, Minimizing a sum of clipped convex functions, Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property, Improved convergence rates and trajectory convergence for primal-dual dynamical systems with vanishing damping, A review of nonlinear FFT-based computational homogenization methods, Accelerated proximal point method for maximally monotone operators, Local linear convergence of an ADMM-type splitting framework for equality constrained optimization, One-bit tensor completion via transformed tensor singular value decomposition, A two-step iterative algorithm for sparse hyperspectral unmixing via total variation, An alternating direction method of multipliers for tensor complementarity problems, Sparsity reconstruction using nonconvex TGpV-shearlet regularization and constrained projection, On the convergence of some iteration processes for $J$-pseudomonotone mixed variational inequalities in uniformly smooth Banach spaces, An approximate sparsity model for inpainting, On the convergence of the dual-type iterative method for mixed variational inequalities, On LQP alternating direction method for solving variational inequality problems with separable structure, Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization, Parallel LQP alternating direction method for solving variational inequality problems with separable structure, Solving semidefinite programming problems via alternating direction methods, Wavelet frame based scene reconstruction from range data, Solving policy design problems: alternating direction method of multipliers-based methods for structured inverse variational inequalities, Alternating direction method for covariance selection models, Layer-wise pre-training low-rank NMF model for mammogram-based breast tumor classification, Truncated fractional-order total variation model for image restoration, Douglas-Rachford splitting and ADMM for pathological convex optimization, Inexact decomposition methods for solving variational inequalities with linear equality constraint, An alternating direction method for general variational inequalities, An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems, On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope, An alternating direction method for solving a class of inverse semi-definite quadratic programming problems, High-order total variation-based Poissonian image deconvolution with spatially adapted regularization parameter, Generalized alternating direction method of multipliers: new theoretical insights and applications, Distributed and consensus optimization for non-smooth image reconstruction, An alternating direction approximate Newton algorithm for ill-conditioned inverse problems with application to parallel MRI, A parallel line search subspace correction method for composite convex optimization, Semisupervised data classification via the Mumford-Shah-Potts-type model, A simple self-adaptive alternating direction method for linear variational inequality problems, Chordal decomposition in operator-splitting methods for sparse semidefinite programs, Optimally linearizing the alternating direction method of multipliers for convex programming, Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms, Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization, A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems, An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge, An ADMM numerical approach to linear parabolic state constrained optimal control problems, A proximal point algorithm with asymmetric linear term, A fast algorithm for solving linear inverse problems with uniform noise removal, A proximal alternating direction method for multi-block coupled convex optimization, Convergence of a class of stationary iterative methods for saddle point problems, Randomized primal-dual proximal block coordinate updates, An LQP-based symmetric alternating direction method of multipliers with larger step sizes, Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints, The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints, A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis, Convergence analysis of alternating direction method of multipliers for a class of separable convex programming, An alternating direction method for mixed Gaussian plus impulse noise removal, Convergence analysis of the relaxed proximal point algorithm, A Peaceman-Rachford splitting method with monotone plus skew-symmetric splitting for nonlinear saddle point problems, On the pointwise iteration-complexity of a dynamic regularized ADMM with over-relaxation stepsize, Proximal operator of quotient functions with application to a feasibility problem in query optimization, Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata, On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers, A partial splitting augmented Lagrangian method for low patch-rank image decomposition, Variational image restoration with constraints on noise whiteness, Two-step fixed-point proximity algorithms for multi-block separable convex problems, Globally convergent block-coordinate techniques for unconstrained optimization, Proximal Splitting Methods in Signal Processing, A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem, Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit, Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers, Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization, On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming, Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA, Global Convergence of Splitting Methods for Nonconvex Composite Optimization, An efficient augmented Lagrangian method with applications to total variation minimization, A smoothing majorization method for matrix minimization, A proximal block minimization method of multipliers with a substitution procedure, GMRES-Accelerated ADMM for Quadratic Objectives, On Nonstationary Iterated Tikhonov Methods for Ill-Posed Equations in Banach Spaces, A Wavelet Frame Method with Shape Prior for Ultrasound Video Segmentation, A Parallel Douglas–Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard Manifolds, A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming, An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing, A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging, A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations, A proximal alternating linearization method for nonconvex optimization problems, Conception optimale ou identification de formes, calcul rapide de la dérivée directionnelle de la fonction coût, Sparse regression with multi-type regularized feature modeling, Convergence of linear Bregman ADMM for nonconvex and nonsmooth problems with nonseparable structure, On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems, A novel regularization based on the error function for sparse recovery, Differentially private precision matrix estimation, Discrete‐Valued Model Predictive Control Using Sum‐of‐Absolute‐Values Optimization, Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming, A proximal ADMM with the Broyden family for convex optimization problems, Benchmarking large-scale distributed convex quadratic programming algorithms, An alternating direction method for total variation denoising, Unified linear convergence of first-order primal-dual algorithms for saddle point problems, Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions, Enforcing geometrical priors in deep networks for semantic segmentation applied to radiotherapy planning, Customized alternating direction methods of multipliers for generalized multi-facility Weber problem, Preconditioned alternating direction method of multipliers for inverse problems with constraints, A unified and tight linear convergence analysis of the relaxed proximal point algorithm, Convergence analysis of the generalized Douglas-Rachford splitting method under Hölder subregularity assumptions, A hybrid alternating minimization algorithm for structured convex optimization problems with application in Poissonian image processing, Alternating direction methods for solving a class of Sylvester-like matrix equations, High Dimensional Change Point Estimation via Sparse Projection, A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem, Alternating direction method of multipliers for nonconvex log total variation image restoration, Investigations on the influence of the boundary conditions when computing the effective crack energy of random heterogeneous materials using fast marching methods, Image Restoration: A General Wavelet Frame Based Model and Its Asymptotic Analysis, Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework, A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems, A survey on operator splitting and decomposition of convex programs, Accelerated Uzawa methods for convex optimization, Convergence rate of a proximal multiplier algorithm for separable convex minimization, Efficient regularization with wavelet sparsity constraints in photoacoustic tomography, Proximal Methods for Stationary Mean Field Games with Local Couplings, Efficient differentiable quadratic programming layers: an ADMM approach, A two-level distributed algorithm for nonconvex constrained optimization, Kantorovich-Rubinstein metric based level-set methods for inverting modulus of gravity-force data, Variational image motion estimation by preconditioned dual optimization, Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming, A 2-block semi-proximal ADMM for solving the H-weighted nearest correlation matrix problem, An alternating direction method of multipliers with a worst-case $O(1/n^2)$ convergence rate, On the Use of ADMM for Imaging Inverse Problems: the Pros and Cons of Matrix Inversions, Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization, Fixed Point Analysis of Douglas--Rachford Splitting for Ptychography and Phase Retrieval, On alternating direction method for solving variational inequality problems with separable structure, Alternating Direction Method of Multiplier for Euler’s Elastica-Based Denoising, Blind image fusion for hyperspectral imaging with the directional total variation, A general system for heuristic minimization of convex functions over non-convex sets, A class of multilevel structured low-rank approximation arising in material processing, Combining Progressive Hedging with a Frank--Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming, Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems, Optimization Methods for Large-Scale Machine Learning, Orthogonal Nonnegative Matrix Factorization by Sparsity and Nuclear Norm Optimization, A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions, Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization tasks, On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization, Unnamed Item, A proximal multiplier method for separable convex minimization, Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems, Low Complexity Regularization of Linear Inverse Problems, Automatic Prior Shape Selection for Image Segmentation, A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization, Projection Methods in Conic Optimization, An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization, An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm, Adaptive augmented Lagrangian methods: algorithms and practical numerical experience, Iterative methods for solving variational inequalities of the theory of soft shells, A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization, Sparse Convex Clustering, A sequential updating scheme of the Lagrange multiplier for separable convex programming, Parallel Statistical Multiresolution Estimation for Image Reconstruction, A new LQP alternating direction method for solving variational inequality problems with separable structure, An alternating direction method for solving convex nonlinear semidefinite programming problems, An alternating direction-based contraction method for linearly constrained separable convex programming problems, The decomposition optimization of complex systems, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization, Unnamed Item, Unnamed Item, Applications of the method of partial inverses to convex programming: Decomposition, A hybrid splitting method for variational inequality problems with separable structure, A fast minimization method for blur and multiplicative noise removal, An inertial proximal alternating direction method of multipliers for nonconvex optimization, Model selection with distributed SCAD penalty, Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method, Restoration of Poissonian Images Using Nonconvex Regularizer with Overlapping Group Sparsity, A Spatial Color Compensation Model Using Saturation-Value Total Variation, Color Image Inpainting via Robust Pure Quaternion Matrix Completion: Error Bound and Weighted Loss, A new accelerated positive-indefinite proximal ADMM for constrained separable convex optimization problems, Sparse Online Variational Bayesian Regression, GADMM: Fast and Communication Efficient Framework for Distributed Machine Learning, Approximation Schemes for Materials with Discontinuities, Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications, Improved Inexact Alternating Direction Methods for a Class of Nonlinear Complementarity Problems, Faster Lagrangian-Based Methods in Convex Optimization, Sparse Single Index Models for Multivariate Responses, Penalized Quantile Regression for Distributed Big Data Using the Slack Variable Representation, An Image Registration Model in Electron Backscatter Diffraction, Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints, A Symmetric Inertial Alternating Direction Method of Multipliers for Elliptic Equation Constrained Optimization Problem, Unnamed Item, Golden Ratio Primal-Dual Algorithm with Linesearch, Automated parameter selection in the ${L}^{1} \mbox{-} {L}^{2}$-TV model for removing Gaussian plus impulse noise, Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications, Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps, Wavelet-based LASSO in functional linear quantile regression, A FE-ADMM algorithm for Lavrentiev-regularized state-constrained elliptic control problem, On the Efficiency of Random Permutation for ADMM and Coordinate Descent, Unnamed Item, The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates, High Order Edge Sensors with $\ell^1$ Regularization for Enhanced Discontinuous Galerkin Methods, Robust Subspace Discovery via Relaxed Rank Minimization, A new alternating projection-based prediction–correction method for structured variational inequalities, Theoretical and Experimental Analyses of Tensor-Based Regression and Classification, Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods, Learning the invisible: a hybrid deep learning-shearlet framework for limited angle computed tomography, Nonlinear optimization for mixed attenuation polyenergetic image reconstruction, Orthogonal Nonnegative Tucker Decomposition, A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond, Nonlinear Forward-Backward Splitting with Projection Correction, SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure, Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem, Unnamed Item, Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization, An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity, Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version, An alternating direction method for linear‐constrained matrix nuclear norm minimization, Median filtering‐based methods for static background extraction from surveillance video, An introduction to continuous optimization for imaging, Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty, ON THE CONVERGENCE RATE OF THE ALTERNATING DIRECTION METHOD OF MULTIPLIERS IN A COMPLEX DOMAIN, Implementing the Alternating Direction Method of Multipliers for Big Datasets: A Case Study of Least Absolute Shrinkage and Selection Operator, Challenges in Optimal Control Problems for Gas and Fluid Flow in Networks of Pipes and Canals: From Modeling to Industrial Applications, A Graph Framework for Manifold-Valued Data, A Reweighted Joint Spatial-Radon Domain CT Image Reconstruction Model for Metal Artifact Reduction, Lattice-Based Patterned Fabric Inspection by Using Total Variation with Sparsity and Low-Rank Representations, A simple effective heuristic for embedded mixed-integer quadratic programming, A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications, Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results, Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold, ADMM for multiaffine constrained optimization, Splitting with Near-Circulant Linear Systems: Applications to Total Variation CT and PET, On the implementation of a primal-dual algorithm for second order time-dependent Mean Field Games with local couplings, Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming, On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM, Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming, Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints, Composite Optimization by Nonconvex Majorization-Minimization, Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem, Solving Large-Scale Optimization Problems with a Convergence Rate Independent of Grid Size, A partial PPA block-wise ADMM for multi-block linearly constrained separable convex optimization, An efficient Peaceman–Rachford splitting method for constrained TGV-shearlet-based MRI reconstruction, Alternating method based on framelet l₀-norm and TV regularization for image restoration, Consistent Dynamic Mode Decomposition, On the choice of Lagrange multipliers in the iterated Tikhonov method for linear ill-posed equations in Banach spaces, Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming, SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD, A partial inexact alternating direction method for structured variational inequalities, Primal-dual gap estimators for a posteriori error analysis of nonsmooth minimization problems, Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators, An alternate minimization method beyond positive definite proximal regularization: convergence and complexity, Unnamed Item, An image sharpening operator combined with framelet for image deblurring, On the Global Linear Convergence of the ADMM with MultiBlock Variables, A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization, An Accelerated Linearized Alternating Direction Method of Multipliers, Image Restoration with Mixed or Unknown Noises, Minimization of $\ell_{1-2}$ for Compressed Sensing, Unnamed Item, A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints, On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming, Split-Douglas--Rachford Algorithm for Composite Monotone Inclusions and Split-ADMM, Local saddles of relaxed averaged alternating reflections algorithms on phase retrieval, A class of nonlinear proximal point algorithms for variational inequality problems, Dual–primal proximal point algorithms for extended convex programming, Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction, ADMM in Krylov Subspace and Its Application to Total Variation Restoration of Spatially Variant Blur, Multi-Domain Regularization Based Computed Tomography for High-Speed Rotation Objects, A Selective Linearization Method For Multiblock Convex Optimization, A proximal partially parallel splitting method for separable convex programs, High-Dimensional Gaussian Sampling: A Review and a Unifying Approach Based on a Stochastic Proximal Point Algorithm, Convergence study on the logarithmic-quadratic proximal regularization of strictly contractive Peaceman–Rachford splitting method with larger step-size, On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error, A saturation-value histogram equalization model for color image enhancement, Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists, An operator-splitting approach for variational optimal control formulations for diffeomorphic shape matching, Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications, Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound, Discrete potential mean field games: duality and numerical resolution, Majorized iPADMM for Nonseparable Convex Minimization Models with Quadratic Coupling Terms, A golden ratio proximal alternating direction method of multipliers for separable convex optimization, ADMM for Penalized Quantile Regression in Big Data, Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping, Efficient learning rate adaptation based on hierarchical optimization approach, Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval, 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, Integrating train service route design with passenger flow allocation for an urban rail transit line, On convergence rates of proximal alternating direction method of multipliers, Finding robust minimizer for non-convex phase retrieval, A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem, Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems, Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials, Complexity analysis of a stochastic variant of generalized alternating direction method of multipliers, Inertial-relaxed splitting for composite monotone inclusions, Sparse identification of dynamical systems by reweighted $l_1$-regularized least absolute deviation regression, Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications, Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization, Doubly time-dependent Hawkes process and applications in failure sequence analysis, Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming, Structured model selection via ℓ1−ℓ2 optimization, A revisit of Chen-Teboulle's proximal-based decomposition method, Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization, A new stopping criterion for Eckstein and Bertsekas's generalized alternating direction method of multipliers, Robust time-of-arrival localization via ADMM, Subspace Estimation with Automatic Dimension and Variable Selection in Sufficient Dimension Reduction, Approximate customized proximal point algorithms for separable convex optimization, Understanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMM, An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression, Time rescaling of a primal-dual dynamical system with asymptotically vanishing damping, Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient, Convergence Results for Primal-Dual Algorithms in the Presence of Adjoint Mismatch, Distributionally robust Weber problem with uncertain demand, Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms, A relaxed proximal ADMM method for block separable convex programming, A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems, Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming, Strongly convergent inertial proximal point algorithm without on-line rule, An Alternating Direction Method of Multipliers for Inverse Lithography Problem, Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems, On mathematical modeling in image reconstruction and beyond, High-dimensional functional graphical model structure learning via neighborhood selection approach, Unnamed Item, A decomposition method for convex minimization problems and its application., Alternating Direction Method of Multipliers for Linear Inverse Problems, A descent method for structured monotone variational inequalities, Optimization, The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent, A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions, A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems, A new convergence proof of augmented Lagrangian-based method with full Jacobian decomposition for structured variational inequalities, 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, Approximate first-order primal-dual algorithms for saddle point problems, Integrating Multidimensional Data for Clustering Analysis With Applications to Cancer Patient Data, Complex-Valued Imaging with Total Variation Regularization: An Application to Full-Waveform Inversion in Visco-acoustic Media, The linearized alternating direction method of multipliers for low-rank and fused LASSO matrix regression model, A primal-dual flow for affine constrained convex optimization, New Splitting Algorithms for Multiplicative Noise Removal Based on Aubert-Aujol Model, Application of the Alternating Direction Method of Multipliers to Control Constrained Parabolic Optimal Control Problems and Beyond, Signal Decomposition Using Masked Proximal Operators

Cites Work