Pages that link to "Item:Q4698101"
From MaRDI portal
The following pages link to Entropy-Like Proximal Methods in Convex Programming (Q4698101):
Displaying 50 items.
- A proximal method with logarithmic barrier for nonlinear complementarity problems (Q280087) (← links)
- Subgradient algorithms for solving variable inequalities (Q297868) (← links)
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces (Q300769) (← links)
- A direct splitting method for nonsmooth variational inequalities (Q398641) (← links)
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant (Q421699) (← links)
- Convergence of a proximal point algorithm for solving minimization problems (Q442796) (← links)
- A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method (Q467410) (← links)
- A steepest descent-like method for variable order vector optimization problems (Q467437) (← links)
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming (Q616787) (← links)
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization. (Q703163) (← links)
- Fast Moreau envelope computation I: Numerical algorithms (Q870763) (← links)
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming (Q925232) (← links)
- A projected subgradient method for solving generalized mixed variational inequalities (Q957374) (← links)
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space (Q1290597) (← links)
- Approximate iterations in Bregman-function-based proximal algorithms (Q1290655) (← links)
- Nonlinear rescaling and proximal-like methods in convex optimization (Q1363410) (← links)
- Equilibrium programming using proximal-like algorithms (Q1373724) (← links)
- Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) (← links)
- On some properties of generalized proximal point methods for variational inequalities (Q1389080) (← links)
- Two algorithms for solving systems of inclusion problems (Q1656662) (← links)
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application (Q1694908) (← links)
- A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem (Q1734367) (← links)
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints (Q1762409) (← links)
- A steepest descent method for vector optimization (Q1765484) (← links)
- Nonsmooth nonconvex global optimization in a Banach space with a basis (Q1767923) (← links)
- A note on the existence of zeroes of convexly regularized sums of maximal monotone operators (Q1873664) (← links)
- Some properties of generalized proximal point methods for quadratic and linear programming (Q1896573) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- Entropy programming modeling of IBNR claims reserves (Q1931646) (← links)
- New proximal type algorithms for convex minimization and its application to image deblurring (Q2085035) (← links)
- On inexact projected gradient methods for solving variable vector optimization problems (Q2138300) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- A proximal interior point algorithm with applications to image processing (Q2203368) (← links)
- Modified projected subgradient method for solving pseudomonotone equilibrium and fixed point problems in Banach spaces (Q2244004) (← links)
- A subgradient method for multiobjective optimization (Q2377160) (← links)
- Modified basic projection methods for a class of equilibrium problems (Q2413497) (← links)
- On the existence and convergence of approximate solutions for equilibrium problems in Banach spaces (Q2471908) (← links)
- New inertial forward-backward algorithm for convex minimization with applications (Q2685895) (← links)
- Inexact accelerated high-order proximal-point methods (Q2689812) (← links)
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems (Q2701420) (← links)
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES (Q2769521) (← links)
- A proximal point algorithm with a ϕ-divergence for quasiconvex programming (Q2786322) (← links)
- Generalized Proximal Distances for Bilevel Equilibrium Problems (Q2796800) (← links)
- On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces (Q2805982) (← links)
- A variant of forward-backward splitting method for the sum of two monotone operators with a new search strategy (Q2808300) (← links)
- On the convergence of the forward–backward splitting method with linesearches (Q2829582) (← links)
- A new duality theory for mathematical programming (Q3112511) (← links)
- An explicit algorithm for monotone variational inequalities (Q3165902) (← links)
- (Q3384224) (← links)
- A steepest descent-like method for vector optimization problems with variable domination structure (Q5052577) (← links)
