Pages that link to "Item:Q4697091"
From MaRDI portal
The following pages link to Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming (Q4697091):
Displaying 50 items.
- On the ergodic convergence rates of a first-order primal-dual algorithm (Q312675) (← links)
- Strong convergence of a hybrid projection iterative algorithm for common solutions of operator equations and of inclusion problems (Q372076) (← links)
- Operator splittings, Bregman methods and frame shrinkage in image processing (Q408893) (← links)
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant (Q421699) (← links)
- Interior proximal methods for quasiconvex optimization (Q427358) (← links)
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods (Q429465) (← links)
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments (Q429466) (← links)
- Modified Lagrangian methods for separable optimization problems (Q437562) (← links)
- Convergence of a proximal point algorithm for solving minimization problems (Q442796) (← links)
- Variational image segmentation models involving non-smooth data-fidelity terms (Q474902) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems (Q613240) (← links)
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming (Q616787) (← links)
- Local search proximal algorithms as decision dynamics with costs to move (Q632228) (← links)
- Approximation of fixed points of weak Bregman relatively nonexpansive mappings in Banach spaces (Q638075) (← links)
- On the convergence of the exponential multiplier method for convex programming (Q688911) (← links)
- Auxiliary principle technique for equilibrium problems (Q702380) (← links)
- An approximate proximal-extragradient type method for monotone variational inequalities (Q703662) (← links)
- Convergent algorithm based on progressive regularization for solving pseudomonotone variational inequalities (Q704729) (← links)
- On a generalized proximal point method for solving equilibrium problems in Banach spaces (Q714471) (← links)
- Inexact proximal point method for general variational inequalities (Q852837) (← links)
- Fast Moreau envelope computation I: Numerical algorithms (Q870763) (← links)
- Proximal methods in reflexive Banach spaces without monotonicity (Q874955) (← links)
- Proximal point algorithms and generalized nonlinear variational problems (Q884159) (← links)
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming (Q925232) (← links)
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming (Q937140) (← links)
- A generalized proximal-point-based prediction-correction method for variational inequality problems (Q950089) (← links)
- Computing proximal points of nonconvex functions (Q959941) (← links)
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems (Q975360) (← links)
- Interior proximal methods and central paths for convex second-order cone programming (Q992842) (← links)
- Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds (Q1014028) (← links)
- Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions (Q1035134) (← links)
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant (Q1037657) (← links)
- Progressive regularization of variational inequalities and decomposition algorithms (Q1265010) (← links)
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators (Q1290609) (← links)
- A variable-penalty alternating directions method for convex optimization (Q1290650) (← links)
- Approximate iterations in Bregman-function-based proximal algorithms (Q1290655) (← links)
- Proximal minimization algorithm with \(D\)-functions (Q1321192) (← links)
- A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
- Nonlinear rescaling and proximal-like methods in convex optimization (Q1363410) (← links)
- An interior point method for the nonlinear complementarity problem (Q1369440) (← links)
- Equilibrium programming using proximal-like algorithms (Q1373724) (← links)
- Generalized Bregman projections in convex feasibility problems (Q1384057) (← 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)
- Nonlinear proximal decomposition method for convex programming (Q1594877) (← links)
- A simplified view of first order methods for optimization (Q1650767) (← links)
- Higher order convergence rates for Bregman iterated variational regularization of inverse problems (Q1713400) (← links)
- A predictor-corrector method for solving equilibrium problems (Q1723834) (← links)
- A cyclic block coordinate descent method with generalized gradient projections (Q1733536) (← links)
