Pages that link to "Item:Q1321192"
From MaRDI portal
The following pages link to Proximal minimization algorithm with \(D\)-functions (Q1321192):
Displaying 50 items.
- A proximal method with logarithmic barrier for nonlinear complementarity problems (Q280087) (← links)
- Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces (Q288117) (← links)
- A weighted mirror descent algorithm for nonsmooth convex optimization problem (Q328453) (← links)
- Moreau's decomposition in Banach spaces (Q353156) (← links)
- Operator splittings, Bregman methods and frame shrinkage in image processing (Q408893) (← links)
- Interior proximal methods for quasiconvex optimization (Q427358) (← links)
- Convergence of a proximal point algorithm for solving minimization problems (Q442796) (← links)
- An asymmetric proximal decomposition method for convex programming with linearly coupling constraints (Q447556) (← links)
- A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors (Q448514) (← links)
- Interior proximal method without the cutting plane property (Q493039) (← links)
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming (Q616787) (← links)
- Iterative approaches to find zeros of maximal monotone operators by hybrid approximate proximal point methods (Q623551) (← links)
- Maximal monotone operators and the proximal point algorithm in the presence of computational errors (Q637560) (← links)
- On the convergence of the exponential multiplier method for convex programming (Q688911) (← links)
- On a generalized proximal point method for solving equilibrium problems in Banach spaces (Q714471) (← links)
- Proximal methods in reflexive Banach spaces without monotonicity (Q874955) (← 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)
- Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces (Q971618) (← 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)
- 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)
- Approximate iterations in Bregman-function-based proximal algorithms (Q1290655) (← links)
- Data parallel computing for network-structured optimization problems (Q1328430) (← links)
- Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations (Q1342646) (← links)
- A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
- An interior point method for the nonlinear complementarity problem (Q1369440) (← links)
- Equilibrium programming using proximal-like algorithms (Q1373724) (← links)
- On some properties of generalized proximal point methods for variational inequalities (Q1389080) (← links)
- Approximation of linear programs by Bregman's \(D_F\) projections (Q1584816) (← 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)
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints (Q1762409) (← links)
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization (Q1783579) (← links)
- Some properties of generalized proximal point methods for quadratic and linear programming (Q1896573) (← links)
- Solving multistage stochastic network programs on massively prallel computers (Q1918923) (← 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)
- Alternating minimization as sequential unconstrained minimization: a survey (Q1949577) (← links)
- An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds (Q1955549) (← links)
- Inertial alternating generalized forward-backward splitting for image colorization (Q1999474) (← links)
- An interior point-proximal method of multipliers for convex quadratic programming (Q2028483) (← links)
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization (Q2044481) (← links)
- Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings (Q2193778) (← links)
