The following pages link to (Q4144736):
Displaying 50 items.
- Parameter Selection and Preconditioning for a Graph Form Solver (Q4625760) (← links)
- An alternating direction method of multipliers with a worst-case $O(1/n^2)$ convergence rate (Q4629373) (← links)
- Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems (Q4632727) (← links)
- (Q4637032) (← links)
- A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
- Optimization Methods for Large-Scale Machine Learning (Q4641709) (← links)
- Orthogonal Nonnegative Matrix Factorization by Sparsity and Nuclear Norm Optimization (Q4643333) (← links)
- A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions (Q4646445) (← links)
- Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization tasks (Q4646540) (← links)
- Implementing the Alternating Direction Method of Multipliers for Big Datasets: A Case Study of Least Absolute Shrinkage and Selection Operator (Q4685334) (← links)
- Challenges in Optimal Control Problems for Gas and Fluid Flow in Networks of Pipes and Canals: From Modeling to Industrial Applications (Q4686738) (← links)
- A Graph Framework for Manifold-Valued Data (Q4686918) (← links)
- A Reweighted Joint Spatial-Radon Domain CT Image Reconstruction Model for Metal Artifact Reduction (Q4686933) (← links)
- Lattice-Based Patterned Fabric Inspection by Using Total Variation with Sparsity and Low-Rank Representations (Q4689660) (← links)
- Quasi-norm error bounds for the finite element approximation of some degenerate quasilinear elliptic equations and variational inequalities (Q4698865) (← links)
- A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications (Q4960078) (← links)
- Block-wise Alternating Direction Method of Multipliers for Multiple-block Convex Programming and Beyond (Q4967329) (← links)
- The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming (Q4967363) (← links)
- On the implementation of a primal-dual algorithm for second order time-dependent Mean Field Games with local couplings (Q4967880) (← links)
- (Q4969054) (← links)
- GADMM: Fast and Communication Efficient Framework for Distributed Machine Learning (Q4969135) (← links)
- (Q4969143) (← links)
- ON THE CONVERGENCE RATE OF THE KRASNOSEL’SKIĬ–MANN ITERATION (Q4975607) (← links)
- Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming (Q4976160) (← links)
- Convergence of ADMM for Three-Block Separable Quadratic Programming Problems with Linear Constraints (Q4985221) (← links)
- A partial PPA block-wise ADMM for multi-block linearly constrained separable convex optimization (Q4986418) (← links)
- An efficient Peaceman–Rachford splitting method for constrained TGV-shearlet-based MRI reconstruction (Q4988514) (← links)
- Unstabilized Hybrid High-order Method for a Class of Degenerate Convex Minimization Problems (Q4989951) (← links)
- On the choice of Lagrange multipliers in the iterated Tikhonov method for linear ill-posed equations in Banach spaces (Q4991489) (← links)
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD (Q4992365) (← links)
- Primal-dual gap estimators for <i>a posteriori</i> error analysis of nonsmooth minimization problems (Q4993995) (← links)
- A conforming mixed finite element method for the Navier–Stokes/Darcy–Forchheimer coupled problem (Q4993997) (← links)
- (Q4994323) (← links)
- (Q4998892) (← links)
- An ADMM-based interior-point method for large-scale linear programming (Q4999335) (← links)
- Total variation of the normal vector field as shape prior (Q5000593) (← links)
- A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization (Q5002572) (← links)
- An ADMM-Newton-CNN numerical approach to a TV model for identifying discontinuous diffusion coefficients in elliptic equations: convex case with gradient observations (Q5002581) (← links)
- Dual methods for frictional contact problem with electroelastic-locking materials (Q5009159) (← links)
- The indefinite proximal point algorithms for maximal monotone operators (Q5009166) (← links)
- On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming (Q5012883) (← links)
- Split-Douglas--Rachford Algorithm for Composite Monotone Inclusions and Split-ADMM (Q5013586) (← links)
- Local saddles of relaxed averaged alternating reflections algorithms on phase retrieval (Q5014488) (← links)
- Numerical Maximization of the <i>p</i>-Laplacian Energy of a Two-Phase Material (Q5023819) (← links)
- High-Dimensional Gaussian Sampling: A Review and a Unifying Approach Based on a Stochastic Proximal Point Algorithm (Q5025734) (← links)
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons (Q5025784) (← links)
- A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems (Q5031806) (← links)
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)
- Model selection with distributed SCAD penalty (Q5036460) (← links)
- A Spatial Color Compensation Model Using Saturation-Value Total Variation (Q5043737) (← links)