Entropy-Like Proximal Methods in Convex Programming
From MaRDI portal
Publication:4698101
DOI10.1287/moor.19.4.790zbMath0821.90092OpenAlexW2032690622MaRDI QIDQ4698101
Marc Teboulle, Alfredo Noel Iusem, Benar Fux Svaiter
Publication date: 27 September 1995
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.19.4.790
Related Items
A note on the existence of zeroes of convexly regularized sums of maximal monotone operators, A proximal gradient splitting method for solving convex vector optimization problems, A proximal method with logarithmic barrier for nonlinear complementarity problems, Strict convex regularizations, proximal points and augmented lagrangians, An explicit algorithm for monotone variational inequalities, Subgradient algorithms for solving variable inequalities, A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces, On inexact projected gradient methods for solving variable vector optimization problems, A steepest descent-like method for vector optimization problems with variable domination structure, A subgradient method for multiobjective optimization, Some properties of generalized proximal point methods for quadratic and linear programming, Nonlinear rescaling and proximal-like methods in convex optimization, The developments of proximal point algorithms, Two algorithms for solving systems of inclusion problems, Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming, Equilibrium programming using proximal-like algorithms, Fast Moreau envelope computation I: Numerical algorithms, On the linear convergence of a Bregman proximal point algorithm, An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities, Subgradient method with entropic projections for convex nondifferentiable minimization, Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant, Modified basic projection methods for a class of equilibrium problems, On some properties of generalized proximal point methods for variational inequalities, Entropy programming modeling of IBNR claims reserves, An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming, A direct splitting method for nonsmooth variational inequalities, Nonmonotone gradient methods for vector optimization with a portfolio optimization application, New inertial forward-backward algorithm for convex minimization with applications, Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm, An extension of proximal methods for quasiconvex minimization on the nonnegative orthant, Inexact accelerated high-order proximal-point methods, Rescaled proximal methods for linearly constrained convex problems, A proximal interior point algorithm with applications to image processing, Convergence of a proximal point algorithm for solving minimization problems, An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems, Unnamed Item, Unnamed Item, Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming, A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method, A steepest descent-like method for variable order vector optimization problems, A parallel subgradient method extended to variational inequalities involving nonexpansive mappings, A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem, Modified projected subgradient method for solving pseudomonotone equilibrium and fixed point problems in Banach spaces, On the existence and convergence of approximate solutions for equilibrium problems in Banach spaces, A projected subgradient method for solving generalized mixed variational inequalities, Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints, A steepest descent method for vector optimization, INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES, Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization., Nonsmooth nonconvex global optimization in a Banach space with a basis, A new family of penalties for augmented Lagrangian methods, A proximal point algorithm with a ϕ-divergence for quasiconvex programming, Dual convergence of the proximal point method with Bregman distances for linear programming, Generalized Proximal Distances for Bilevel Equilibrium Problems, On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces, A variant of forward-backward splitting method for the sum of two monotone operators with a new search strategy, On the convergence of the forward–backward splitting method with linesearches, A new duality theory for mathematical programming, On the projected subgradient method for nonsmooth convex optimization in a Hilbert space, Approximate iterations in Bregman-function-based proximal algorithms, New proximal type algorithms for convex minimization and its application to image deblurring, Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure, Penalty/Barrier multiplier algorthm for semidefinit programming∗
