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.
- A primal-dual proximal point algorithm for constrained convex programs (Q1763276) (← links)
- A relaxed approximate proximal point algorithm (Q1772967) (← links)
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization (Q1783579) (← links)
- A parameterized proximal point algorithm for separable convex optimization (Q1800446) (← links)
- Proximal methods for mixed variational inequalities (Q1812066) (← links)
- Proximal methods for mixed quasivariational inequalities (Q1812067) (← 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)
- On linear convergence of iterative methods for the variational inequality problem (Q1900764) (← links)
- On the twice differentiable cubic augmented Lagrangian (Q1908654) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- Interior point methods for equilibrium problems (Q1928742) (← links)
- An interior proximal method for a class of quasimonotone variational inequalities (Q1935257) (← links)
- An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration (Q1945380) (← links)
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis (Q2010228) (← links)
- An interior point-proximal method of multipliers for convex quadratic programming (Q2028483) (← links)
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
- Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem (Q2158622) (← links)
- Theoretical aspect of diagonal Bregman proximal methods (Q2176024) (← links)
- The multiproximal linearization method for convex composite problems (Q2191762) (← links)
- Inexact version of Bregman proximal gradient algorithm (Q2198034) (← links)
- Bregman Itoh-Abe methods for sparse optimisation (Q2203362) (← links)
- On generalized Bregman nonspreading mappings and zero points of maximal monotone operator in a reflexive Banach space (Q2211436) (← links)
- An adaptive primal-dual framework for nonsmooth convex minimization (Q2220901) (← links)
- Generalized Bregman envelopes and proximity operators (Q2231335) (← links)
- Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity (Q2302825) (← links)
- A proximal point algorithm with asymmetric linear term (Q2311109) (← links)
- On a Bregman regularized proximal point method for solving equilibrium problems (Q2311203) (← links)
- On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity (Q2322369) (← links)
- Lagrangian transformation and interior ellipsoid methods in convex optimization (Q2342139) (← links)
- Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs (Q2366829) (← links)
- A new algorithm for finding fixed points of Bregman quasi-nonexpansive mappings and zeros of maximal monotone operators by using products of resolvents (Q2410856) (← links)
- A simple convergence analysis of Bregman proximal gradient algorithm (Q2419573) (← links)
- A new generalized APPA for maximal monotone operators (Q2469710) (← links)
- Comparison of two proximal point algorithms for monotone variational inequalities (Q2469901) (← links)
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces (Q2491413) (← links)
- Generalized partially relaxed pseudomonotone variational inequalities and general auxiliary problem principle (Q2491544) (← links)
- Modified approximate proximal point algorithms for finding roots of maximal monotone operators (Q2501443) (← links)
- Double-regularization proximal methods, with complementarity applications (Q2506183) (← links)
- Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design (Q2519532) (← links)
- A proximal trust-region algorithm for column generation stabilization (Q2571184) (← links)
- Decomposition for structured convex programs with smooth multiplier methods (Q2572336) (← links)
- Strong convergence theorems for equilibrium problems and weak Bregman relatively nonexpansive mappings in Banach spaces (Q2636689) (← links)
- Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework (Q2643765) (← links)
- Bregman three-operator splitting methods (Q2696977) (← links)
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems (Q2701420) (← links)
- Dykstras algorithm with bregman projections: A convergence proof (Q2709445) (← links)
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES (Q2769521) (← links)
