Entropy-Like Proximal Methods in Convex Programming
From MaRDI portal
Recommendations
- A unifying approach to entropy-like multiplier methods in convex programming
- Convergence of Proximal-Like Algorithms
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- A generalized like-distance in convex programming
Cited in
(80)- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Approximate iterations in Bregman-function-based proximal algorithms
- On the convergence rate of entropic proximal optimization methods
- Nonlinear rescaling and proximal-like methods in convex optimization
- Equilibrium programming using proximal-like algorithms
- Subgradient method with entropic projections for convex nondifferentiable minimization
- On some properties of generalized proximal point methods for variational inequalities
- Two algorithms for solving systems of inclusion problems
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- A steepest descent method for vector optimization
- Nonsmooth nonconvex global optimization in a Banach space with a basis
- A note on the existence of zeroes of convexly regularized sums of maximal monotone operators
- Some properties of generalized proximal point methods for quadratic and linear programming
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Entropy programming modeling of IBNR claims reserves
- New proximal type algorithms for convex minimization and its application to image deblurring
- On inexact projected gradient methods for solving variable vector optimization problems
- The developments of proximal point algorithms
- A proximal interior point algorithm with applications to image processing
- Modified projected subgradient method for solving pseudomonotone equilibrium and fixed point problems in Banach spaces
- A subgradient method for multiobjective optimization
- Modified basic projection methods for a class of equilibrium problems
- On the existence and convergence of approximate solutions for equilibrium problems in Banach spaces
- New inertial forward-backward algorithm for convex minimization with applications
- Inexact accelerated high-order proximal-point methods
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES
- Rescaling and stepsize selection in proximal methods using separable generalized distances
- A proximal point algorithm with a -divergence for quasiconvex programming
- Generalized proximal distances for bilevel equilibrium problems
- A proximal method with logarithmic barrier for nonlinear complementarity problems
- Relative entropy relaxations for signomial optimization
- 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
- Subgradient algorithms for solving variable inequalities
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
- A new duality theory for mathematical programming
- An explicit algorithm for monotone variational inequalities
- A double forward-backward algorithm using linesearches for minimization problem
- A unifying approach to entropy-like multiplier methods in convex programming
- 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 family of penalties for augmented Lagrangian methods
- Forward mean proximal pairs and zero entropy
- A direct splitting method for nonsmooth variational inequalities
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- Convergence of Proximal-Like Algorithms
- Convergence of a proximal point algorithm for solving minimization problems
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- Strict convex regularizations, proximal points and augmented lagrangians
- Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective 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
- Entropy methods in asymptotic convex geometry
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Inexact high-order proximal-point methods with auxiliary search procedure
- A proximal gradient splitting method for solving convex vector optimization problems
- A steepest descent-like method for vector optimization problems with variable domination structure
- On the linear convergence of a Bregman proximal point algorithm
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
- A parallel subgradient method extended to variational inequalities involving nonexpansive mappings
- Dual convergence of the proximal point method with Bregman distances for linear programming
- Proximal averages for minimization of entropy functionals
- Inertial proximal gradient method using adaptive stepsize for convex minimization problems
- 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
- High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
- Bregman distance regularization for nonsmooth and nonconvex optimization
- Accelerated forward-backward algorithm based on inertial and correction terms with linesearch for solving convex minimization problem and its application
- On the convergence of the exponential multiplier method for convex programming
- On the convergence analysis of a proximal gradient method for multiobjective optimization
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
- Fast Moreau envelope computation I: Numerical algorithms
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- A projected subgradient method for solving generalized mixed variational inequalities
This page was built for publication: Entropy-Like Proximal Methods in Convex Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698101)
