Pages that link to "Item:Q1290655"
From MaRDI portal
The following pages link to Approximate iterations in Bregman-function-based proximal algorithms (Q1290655):
Displayed 50 items.
- 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)
- 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)
- Interior proximal method for variational inequalities: Case of nonparamonotone operators (Q1771256) (← links)
- A relaxed approximate proximal point algorithm (Q1772967) (← links)
- Steered sequential projections for the inconsistent convex feasibility problem (Q1888607) (← links)
- Pseudomonotone operators and the Bregman proximal point algorithm (Q1959229) (← links)
- Approximate proximal methods in vector optimization (Q2370322) (← links)
- An self-adaptive LQP method for constrained variational inequalities (Q2383674) (← 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)
- An inexact proximal-type algorithm in Banach spaces (Q2465461) (← links)
- A new generalized APPA for maximal monotone operators (Q2469710) (← links)
- Comparison of two proximal point algorithms for monotone variational inequalities (Q2469901) (← links)
- An inexact logarithmic-quadratic proximal augmented Lagrangian method for a class of constrained variational inequalities (Q2472183) (← links)
- Approximate proximal algorithms for generalized variational inequalities with pseudomonotone multifunctions (Q2479349) (← links)
- A new criterion for the inexact logarithmic-quadratic proximal method and its derived hybrid methods (Q2481370) (← links)
- A new relative error criterion for the proximal point algorithm (Q2489498) (← links)
- A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems (Q2497398) (← 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)
- Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework (Q2643765) (← links)
- Approximating zeros of monotone operators by proximal point algorithms (Q2655341) (← links)
- Dykstras algorithm with bregman projections: A convergence proof (Q2709445) (← links)
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS<sup>*</sup> (Q2785250) (← links)
- On inexact generalized proximal methods with a weakened error tolerance criterion (Q4656055) (← links)
- Extended auxiliary problem principle using Bregman distances (Q4669792) (← links)
- Extended auxiliary problem principle to variational inequalities involving multi-valued operators (Q4822675) (← links)
- Bregman functions and auxiliary problem principle (Q5459819) (← links)
- Bregman-like functions and proximal methods for variational problems with nonlinear constraints (Q5758218) (← links)
- A new accuracy criterion for approximate proximal point algorithms (Q5955039) (← links)