Lagrangian penalization scheme with parallel forward-backward splitting
DOI10.1007/S10957-018-1265-XzbMATH Open1396.49032OpenAlexW2792910584WikidataQ130083108 ScholiaQ130083108MaRDI QIDQ725876FDOQ725876
Authors: Cesare Molinari, Juan Peypouquet
Publication date: 2 August 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1265-x
Recommendations
- Lagrangian-penalization algorithm for constrained optimization and variational inequalities
- A new parallel splitting descent method for structured variational inequalities
- Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities
- A parallel splitting method for separable convex programs
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Variational inequalities (49J40)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Nonlinear total variation based noise removal algorithms
- Title not available (Why is that?)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex analysis and monotone operator theory in Hilbert spaces
- Title not available (Why is that?)
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Functional analysis, Sobolev spaces and partial differential equations
- A proximal-based deomposition method for compositions method for convex minimization problems
- Image recovery via total variation minimization and related problems
- Enlargement of monotone operators with applications to variational inequalities
- Image denoising: learning the noise model via nonsmooth PDE-constrained optimization
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convex programming in Hilbert space
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Title not available (Why is that?)
- Produits infinis de resolvantes
- Title not available (Why is that?)
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- \(\varepsilon\)-subdifferentials in terms of subdifferentials
- Convex Optimization in Normed Spaces
- Modified Lagrangians in convex programming and their generalizations
- Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
- Interior-point Lagrangian decomposition method for separable convex optimization
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A generalized forward-backward splitting
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Augmented Lagrangian and proximal alternating direction methods of multipliers in Hilbert spaces. Applications to games, PDE's and control
- Penalty-proximal methods in convex programming
- Proximal alternating directions method for structured variational inequalities
- Lagrangian-penalization algorithm for constrained optimization and variational inequalities
- A proximal multiplier method for separable convex minimization
- The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than \(1/k^2\)
- A preconditioned descent algorithm for variational inequalities of the second kind involving the \(p\)-Laplacian operator
Cited In (5)
- Sparse source identification of linear diffusion-advection equations by adjoint methods
- Fast iterative regularization by reusing data
- Title not available (Why is that?)
- Alternating forward-backward splitting for linearly constrained optimization problems
- Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities
This page was built for publication: Lagrangian penalization scheme with parallel forward-backward splitting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q725876)