A customized proximal point algorithm for convex minimization with linear constraints
From MaRDI portal
Publication:2636606
DOI10.1007/s10589-013-9564-5zbMath1287.90048OpenAlexW1969198137MaRDI QIDQ2636606
Wenxing Zhang, Xiao-Ming Yuan, Bing-sheng He
Publication date: 30 January 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9564-5
Related Items
General parameterized proximal point algorithm with applications in statistical learning ⋮ Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming ⋮ An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem ⋮ Some results concerning the solution mappings of mixed variational inequality problems ⋮ A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems ⋮ An accelerated proximal augmented Lagrangian method and its application in compressive sensing ⋮ 3D diffeomorphic image registration with Cauchy–Riemann constraint and lower bounded deformation divergence ⋮ A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities ⋮ Inertial primal-dual dynamics with damping and scaling for linearly constrained convex optimization problems ⋮ Customized alternating direction methods of multipliers for generalized multi-facility Weber problem ⋮ Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints ⋮ A 2D diffeomorphic image registration model with inequality constraint ⋮ Approximate customized proximal point algorithms for separable convex optimization ⋮ An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function ⋮ A proximal point algorithm revisit on the alternating direction method of multipliers ⋮ A variational inequality approach for constrained multifacility Weber problem under gauge ⋮ An implementable first-order primal-dual algorithm for structured convex optimization ⋮ Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems ⋮ Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit ⋮ A prediction-correction-based primal-dual hybrid gradient method for linearly constrained convex minimization ⋮ A class of customized proximal point algorithms for linearly constrained convex optimization ⋮ A parameterized proximal point algorithm for separable convex optimization ⋮ Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach ⋮ A proximal point-like method for symmetric finite element model updating problems ⋮ Robust linear neural network for constrained quadratic optimization ⋮ ADMM-type methods for generalized multi-facility Weber problem ⋮ Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization ⋮ A customized proximal point algorithm for stable principal component pursuit with nonnegative constraint ⋮ PPA-like contraction methods for convex optimization: a framework using variational inequality approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A unified primal-dual algorithm framework based on Bregman iteration
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- An algorithm for total variation minimization and applications
- Multiplier and gradient methods
- Edge Direction Preserving Image Zooming: A Mathematical and Numerical Analysis
- Atomic Decomposition by Basis Pursuit
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- Deblurring Images
- Efficient Schemes for Total Variation Minimization Under Constraints in Image Processing
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Modified Lagrangians in convex programming and their generalizations
- A Variable Metric Proximal Point Algorithm for Monotone Operators
- Numerical Optimization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Sparse Image and Signal Processing
