Pages that link to "Item:Q1290655"
From MaRDI portal
The following pages link to Approximate iterations in Bregman-function-based proximal algorithms (Q1290655):
Displaying 50 items.
- LQP method with a new optimal step size rule for nonlinear complementarity problems (Q264934) (← links)
- Error sensitivity for strongly convergent modifications of the proximal point algorithm (Q283935) (← links)
- An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems (Q295005) (← links)
- An inexact proximal method for quasiconvex minimization (Q319853) (← links)
- An approximate proximal point algorithm for maximal monotone inclusion problems (Q410335) (← 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)
- Interior proximal method without the cutting plane property (Q493039) (← links)
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization (Q604261) (← links)
- New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems (Q613240) (← links)
- Iterative approaches to find zeros of maximal monotone operators by hybrid approximate proximal point methods (Q623551) (← links)
- The prox-Tikhonov regularization method for the proximal point algorithm in Banach spaces (Q656965) (← links)
- An approximate proximal-extragradient type method for monotone variational inequalities (Q703662) (← links)
- An interior proximal point algorithm for nonlinear complementarity problems (Q708086) (← links)
- A new logarithmic-quadratic proximal method for nonlinear complementarity problems (Q732410) (← links)
- Inexact proximal point method for general variational inequalities (Q852837) (← links)
- The prediction-correction approach to nonlinear complementarity problems (Q853010) (← links)
- A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities (Q853670) (← links)
- A framework for analyzing local convergence properties with applications to proximal-point algorithms (Q868573) (← links)
- On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators (Q929604) (← links)
- Approximate proximal point algorithms for finding zeroes of maximal monotone operators in Hilbert spaces (Q938427) (← 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-point algorithm using a linear proximal term (Q1028604) (← links)
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems (Q1031700) (← links)
- Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions (Q1035134) (← links)
- Proximal point algorithms for general variational inequalities (Q1035903) (← links)
- Generalized Bregman projections in convex feasibility problems (Q1384057) (← links)
- Nonlinear proximal decomposition method for convex programming (Q1594877) (← links)
- An inexact proximal method with proximal distances for quasimonotone equilibrium problems (Q1689071) (← links)
- Interior proximal method for variational inequalities: Case of nonparamonotone operators (Q1771256) (← links)
- A relaxed approximate proximal point algorithm (Q1772967) (← links)
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization (Q1783579) (← links)
- Steered sequential projections for the inconsistent convex feasibility problem (Q1888607) (← links)
- An interior proximal method for a class of quasimonotone variational inequalities (Q1935257) (← links)
- An accelerated inexact proximal point algorithm for convex minimization (Q1937079) (← links)
- A modified proximal point algorithm with errors for approximating solution of the general variational inclusion (Q1939715) (← links)
- Pseudomonotone operators and the Bregman proximal point algorithm (Q1959229) (← links)
- A general self-adaptive relaxed-PPA method for convex programming with linear constraints (Q2015595) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- Strong convergence of a splitting algorithm for treating monotone operators (Q2264177) (← links)
- A proximal point algorithm with asymmetric linear term (Q2311109) (← links)
- Approximate proximal methods in vector optimization (Q2370322) (← links)
- An self-adaptive LQP method for constrained variational inequalities (Q2383674) (← links)
- Strong convergence theorems for approximating common fixed points of families of nonexpansive mappings and applications (Q2393058) (← links)
- Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces (Q2419566) (← links)
- Modified proximal-point method for nonlinear complementarity problems (Q2433761) (← links)
- An LQP method for pseudomonotone variational inequalities (Q2433923) (← links)
- An APPA-based descent method with optimal step-sizes for monotone variational inequalities (Q2462142) (← links)
