Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
From MaRDI portal
(Redirected from Publication:3977035)
augmented Lagrangianmaximal monotone operatorsreal Hilbert spacesalternating minimizationcontinuous linear operators
Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Variational inequalities (49J40) Programming in abstract spaces (90C48)
Recommendations
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Splitting algorithms for general pseudomonotone mixed variational inequalities
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
Cited in
(only showing first 100 items - show all)- A new alternating projection-based prediction-correction method for structured variational inequalities
- Linearized proximal alternating minimization algorithm for motion deblurring by nonlocal regularization
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- Outer Approximation Method for Constrained Composite Fixed Point Problems Involving Lipschitz Pseudo Contractive Operators
- A Weibull gradient prior for image restoration
- Scaled alternating multiplier method for solving the matrix equation AXB + CXD = E
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
- Decomposition methods for sparse matrix nearness problems
- An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
- An alternating direction method of multipliers for elliptic equation constrained optimization problem
- Converting ADMM to a proximal gradient for efficient sparse estimation
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems
- Benders decomposition for a class of variational inequalities
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- An accelerated forward-backward splitting algorithm for solving inclusion problems with applications to regression and link prediction problems
- Approximations in proximal bundle methods and decomposition of convex programs
- Newton's method for quadratic stochastic programs with recourse
- Block-wise primal-dual algorithms for large-scale doubly penalized ANOVA modeling
- A parallel inexact Newton method for stochastic programs with recourse
- A decomposition method for convex minimization problems and its application.
- Forward-backward splitting methods for accretive operators in Banach spaces
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Convergence of the augmented decomposition algorithm
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- Minimization of equilibrium problems, variational inequality problems and fixed point problems
- An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function
- Decomposition algorithm for convex differentiable minimization
- A smooth primal-dual optimization framework for nonsmooth composite convex minimization
- Operator splittings, Bregman methods and frame shrinkage in image processing
- Viscosity approximation for split monotone variational inclusions and fixed point problem
- A projective splitting algorithm for solving generalized mixed variational inequalities
- Convex Hodge decomposition and regularization of image flows
- On the convergence of the forward-backward splitting method with linesearches
- Study on the Splitting Methods for Separable Convex Optimization in a Unified Algorithmic Framework
- Analysis of the inexact Uzawa algorithms for nonlinear saddle-point problems
- The forward-backward algorithm and the normal problem
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- First-order methods for convex optimization
- A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
- Proximal Gradient Methods for Machine Learning and Imaging
- Splitting forward-backward penalty scheme for constrained variational problems
- Application of the alternating direction method of multipliers to separable convex programming problems
- A projected subgradient method for solving generalized mixed variational inequalities
- A proximal bundle approach for solving the generalized variational inequalities with inexact data
- Alternating minimization algorithm with a probability generating function-based distance measure
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Split Bregman iteration algorithm for total bounded variation regularization based image deblurring
- Proximal splitting methods in signal processing
- A proximal-based deomposition method for compositions method for convex minimization problems
- Bounding duality gap for separable problems with linear constraints
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators
- Vector network equilibrium problems with elastic demands
- An algorithm for finding common solutions of various problems in nonlinear operator theory
- Inexact proximal penalty alternating linearization decomposition scheme of nonsmooth convex constrained optimization problems
- Alternating minimization for regression with tropical rational functions
- Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- Fast augmented Lagrangian method in the convex regime with convergence guarantees for the iterates
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- Global convergence of splitting methods for nonconvex composite optimization
- Progressive regularization of variational inequalities and decomposition algorithms
- Forward-partial inverse-forward splitting for solving monotone inclusions
- An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems
- Dual gradient method for ill-posed problems using multiple repeated measurement data
- Inertial approximation method for split variational inclusion problem in Banach spaces
- A dynamical splitting method for minimizing the sum of three convex functions
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- Operator splitting performance estimation: tight contraction factors and optimal parameter selection
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- Strong Convergence of an Inexact Proximal Point Algorithm for Equilibrium Problems in Banach Spaces
- The geometry of monotone operator splitting methods
- The Glowinski-Le Tallec splitting method revisited: a general convergence and convergence rate analysis
- An adaptive alternating direction method of multipliers
- scientific article; zbMATH DE number 125248 (Why is no real title available?)
- Stability and experimental comparison of prototypical iterative schemes for total variation regularized problems
- Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods
- A parallel descent algorithm for convex programming
- Alternating direction method for generalized Sylvester matrix equation \(AXB + CYD = E\)
- New decomposition methods for solving variational inequality problems.
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
- A Variable Metric Extension of the Forward–Backward–Forward Algorithm for Monotone Operators
- Convergence of a splitting inertial proximal method for monotone operators
- scientific article; zbMATH DE number 7733428 (Why is no real title available?)
- An inexact Uzawa algorithmic framework for nonlinear saddle point problems with applications to elliptic optimal control problem
- An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
- Algorithmic approach to a minimization problem
- Visco-penalization of the sum of two monotone operators
- Generalized risk parity portfolio optimization: an ADMM approach
- Solving policy design problems: alternating direction method of multipliers-based methods for structured inverse variational inequalities
- The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
- Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions
- On preconditioned Uzawa methods and SOR methods for saddle-point problems
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- scientific article; zbMATH DE number 2210607 (Why is no real title available?)
- Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms
- Two steps at a time-taking GAN training in stride with Tseng's method
- Fifty years of maximal monotonicity
- New approach to the -proximal point algorithm and nonlinear variational inclusion problems
- Family of perturbation methods for variational inequalities
This page was built for publication: Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3977035)
