Convergence of Proximal-Like Algorithms
From MaRDI portal
Publication:4376157
DOI10.1137/S1052623495292130zbMath0890.90151MaRDI QIDQ4376157
Publication date: 10 February 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Related Items (92)
LQP method with a new optimal step size rule for nonlinear complementarity problems ⋮ A note on the existence of zeroes of convexly regularized sums of maximal monotone operators ⋮ A descent LQP alternating direction method for solving variational inequality problems with separable structure ⋮ Some proximal algorithms for linearly constrained general variational inequalities ⋮ Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities ⋮ Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces ⋮ On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations ⋮ Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere ⋮ An inexact LQP alternating direction method for solving a class of structured variational inequalities ⋮ An self-adaptive LQP method for constrained variational inequalities ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ The prediction-correction approach to nonlinear complementarity problems ⋮ A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities ⋮ A simplified view of first order methods for optimization ⋮ Building initial partitions through sampling techniques ⋮ The developments of proximal point algorithms ⋮ Unnamed Item ⋮ Approximating zeros of monotone operators by proximal point algorithms ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ Subgradient method with entropic projections for convex nondifferentiable minimization ⋮ Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant ⋮ Algorithms for stochastic optimization with function or expectation constraints ⋮ An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming ⋮ A simple convergence analysis of Bregman proximal gradient algorithm ⋮ Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization ⋮ Iterative approaches to find zeros of maximal monotone operators by hybrid approximate proximal point methods ⋮ Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm ⋮ An extension of proximal methods for quasiconvex minimization on the nonnegative orthant ⋮ Local search proximal algorithms as decision dynamics with costs to move ⋮ Rescaled proximal methods for linearly constrained convex problems ⋮ An optimal method for stochastic composite optimization ⋮ An interior proximal method in vector optimization ⋮ A new predicto-corrector method for pseudomonotone nonlinear complementarity problems ⋮ Modified proximal-point method for nonlinear complementarity problems ⋮ An LQP method for pseudomonotone variational inequalities ⋮ Modified Lagrangian methods for separable optimization problems ⋮ An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems ⋮ An asymmetric proximal decomposition method for convex programming with linearly coupling constraints ⋮ Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming ⋮ Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization ⋮ Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem ⋮ An inexact alternating direction method for solving a class of structured variational inequalities ⋮ Convergence Rate of $\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems ⋮ Proximal alternating directions method for structured variational inequalities ⋮ On Decomposition Models in Imaging Sciences and Multi-time Hamilton--Jacobi Partial Differential Equations ⋮ A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem ⋮ Interior proximal method without the cutting plane property ⋮ Unnamed Item ⋮ An APPA-based descent method with optimal step-sizes for monotone variational inequalities ⋮ A new alternating direction method for linearly constrained nonconvex optimization problems ⋮ Generalized proximal point algorithms for multiobjective optimization problems ⋮ On the optimal linear convergence rate of a generalized proximal point algorithm ⋮ SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure ⋮ A generalized proximal-point-based prediction-correction method for variational inequality problems ⋮ A new generalized APPA for maximal monotone operators ⋮ An inexact logarithmic-quadratic proximal augmented Lagrangian method for a class of constrained variational inequalities ⋮ On inexact generalized proximal methods with a weakened error tolerance criterion ⋮ A new criterion for the inexact logarithmic-quadratic proximal method and its derived hybrid methods ⋮ Extended LQP method for monotone nonlinear complementarity problems ⋮ Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints ⋮ An improved proximal alternating direction method for monotone variational inequalities with separable structure ⋮ On LQP alternating direction method for solving variational inequality problems with separable structure ⋮ Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis ⋮ Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization. ⋮ An LQP-SQP 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 ⋮ An interior proximal point algorithm for nonlinear complementarity problems ⋮ Solving a class of constrained `black-box' inverse variational inequalities ⋮ A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems ⋮ A proximal point algorithm with a ϕ-divergence for quasiconvex programming ⋮ A new accuracy criterion for approximate proximal point algorithms ⋮ The generalized proximal point algorithm with step size 2 is not necessarily convergent ⋮ A proximal multiplier method for separable convex minimization ⋮ A distributed algorithm for solving mixed equilibrium problems ⋮ Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization ⋮ A new logarithmic-quadratic proximal method for nonlinear complementarity problems ⋮ A proximal point algorithm with asymmetric linear term ⋮ 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 ⋮ Approximation of linear programs by Bregman's \(D_F\) projections ⋮ Interior projection-like methods for monotone variational inequalities ⋮ Decomposition for structured convex programs with smooth multiplier methods ⋮ The indefinite proximal point algorithms for maximal monotone operators ⋮ On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators ⋮ Nonlinear proximal decomposition method for convex programming ⋮ A class of nonlinear proximal point algorithms for variational inequality problems
This page was built for publication: Convergence of Proximal-Like Algorithms
