Convergence of Proximal-Like Algorithms
From MaRDI portal
Recommendations
- Entropy-Like Proximal Methods in Convex Programming
- scientific article; zbMATH DE number 125245
- On the convergence rate of entropic proximal optimization methods
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
Cited in
(only showing first 100 items - show all)- On the choice of explicit stabilizing terms in column generation
- Competitive facility location on decentralized supply chains
- Proximal-point algorithm using a linear proximal term
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- Proximal point algorithms for general variational inequalities
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
- Approximate iterations in Bregman-function-based proximal algorithms
- On the convergence rate of entropic proximal optimization methods
- Subgradient method with entropic projections for convex nondifferentiable minimization
- Approximation of linear programs by Bregman's \(D_F\) projections
- Nonlinear proximal decomposition method for convex programming
- A simplified view of first order methods for optimization
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem
- A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem
- On the optimal linear convergence rate of a generalized proximal point algorithm
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- A note on the existence of zeroes of convexly regularized sums of maximal monotone operators
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- Convergence of stochastic proximal gradient algorithm
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
- The developments of proximal point algorithms
- Algorithms for stochastic optimization with function or expectation constraints
- On LQP alternating direction method for solving variational inequality problems with separable structure
- Parallel LQP alternating direction method for solving variational inequality problems with separable structure
- Self-adaptive projection-based prediction-correction method for constrained variational inequalities
- Solving a class of constrained `black-box' inverse variational inequalities
- A distributed algorithm for solving mixed equilibrium problems
- A proximal point algorithm with asymmetric linear term
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
- An self-adaptive LQP method for constrained variational inequalities
- A simple convergence analysis of Bregman proximal gradient algorithm
- Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization
- Modified proximal-point method for nonlinear complementarity problems
- An LQP method for pseudomonotone variational inequalities
- An inexact alternating direction method for solving a class of structured variational inequalities
- Proximal alternating directions method for structured variational inequalities
- An APPA-based descent method with optimal step-sizes for monotone variational inequalities
- A new generalized APPA for maximal monotone operators
- An inexact logarithmic-quadratic proximal augmented Lagrangian method for a class of constrained variational inequalities
- A new criterion for the inexact logarithmic-quadratic proximal method and its derived hybrid methods
- Extended LQP method for monotone nonlinear complementarity problems
- A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems
- Interior projection-like methods for monotone variational inequalities
- Decomposition for structured convex programs with smooth multiplier methods
- Building initial partitions through sampling techniques
- LQP method with a new optimal step size rule for nonlinear complementarity problems
- Approximating zeros of monotone operators by proximal point algorithms
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
- Rescaling and stepsize selection in proximal methods using separable generalized distances
- A proximal point algorithm with a -divergence for quasiconvex programming
- A proximal multiplier method for separable convex minimization
- Ergodic convergence of a stochastic proximal point algorithm
- Some proximal algorithms for linearly constrained general variational inequalities
- Decomposition methods based on augmented Lagrangians: a survey
- A descent LQP alternating direction method for solving variational inequality problems with separable structure
- Generalized proximal point algorithms for multiobjective optimization problems
- Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- An inexact LQP alternating direction method for solving a class of structured variational inequalities
- On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations
- A generalized like-distance in convex programming
- Rescaled proximal methods for linearly constrained convex problems
- A proximal-like algorithm for a class of nonconvex programming
- A new predicto-corrector method for pseudomonotone nonlinear complementarity problems
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- An optimal method for stochastic composite optimization
- Modified Lagrangian methods for separable optimization problems
- An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
- On inexact generalized proximal methods with a weakened error tolerance criterion
- Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
- Entropy-Like Proximal Methods in Convex Programming
- On the convergence of the proximal algorithm for saddle-point problems
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Interior proximal method without the cutting plane property
- A new alternating direction method for linearly constrained nonconvex optimization problems
- Discerning the linear convergence of ADMM for structured convex optimization through the lens of variational analysis
- The indefinite proximal point algorithms for maximal monotone operators
- Linear and superlinear convergence of an inexact algorithm with proximal distances for variational inequality problems
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
- Convergence rate of \(\mathcal{O}(1/k)\) for optimistic gradient and extragradient methods in smooth convex-concave saddle point problems
- On decomposition models in imaging sciences and multi-time Hamilton-Jacobi partial differential equations
- SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure
- Error bounds, quadratic growth, and linear convergence of proximal methods
- A class of nonlinear proximal point algorithms for variational inequality problems
- scientific article; zbMATH DE number 5070317 (Why is no real title available?)
- An improved proximal alternating direction method for monotone variational inequalities with separable structure
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- scientific article; zbMATH DE number 2221962 (Why is no real title available?)
- An LQP-SQP alternating direction method for solving variational inequality problems with separable structure
- A new accuracy criterion for approximate proximal point algorithms
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming
- Iterative approaches to find zeros of maximal monotone operators by hybrid approximate proximal point methods
- Local search proximal algorithms as decision dynamics with costs to move
- An interior proximal method in vector optimization
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
- An interior proximal point algorithm for nonlinear complementarity problems
- The generalized proximal point algorithm with step size 2 is not necessarily convergent
This page was built for publication: Convergence of Proximal-Like Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376157)
