Pages that link to "Item:Q604261"
From MaRDI portal
The following pages link to Hybrid approximate proximal method with auxiliary variational inequality for vector optimization (Q604261):
Displayed 31 items.
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds (Q382906) (← 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)
- Convergence of the projected gradient method for quasiconvex multiobjective optimization (Q555040) (← links)
- Hybrid proximal methods for equilibrium problems (Q694191) (← links)
- A proximal point-type method for multicriteria optimization (Q741360) (← links)
- Inexact proximal point methods in metric spaces (Q763334) (← links)
- An inertial Popov's method for solving pseudomonotone variational inequalities (Q828702) (← links)
- Tikhonov-type regularization method for efficient solutions in vector optimization (Q966089) (← links)
- An abstract proximal point algorithm (Q1630279) (← links)
- An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization (Q1695823) (← links)
- On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds (Q1697905) (← links)
- Proximal point method for a special class of nonconvex multiobjective optimization functions (Q1744628) (← links)
- A strongly convergent proximal point method for vector optimization (Q2046562) (← links)
- A study of Liu-Storey conjugate gradient methods for vector optimization (Q2139818) (← links)
- A quasi-Newton method with Wolfe line searches for multiobjective optimization (Q2159465) (← links)
- On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects (Q2190750) (← links)
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization (Q2191796) (← links)
- On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems (Q2191802) (← links)
- The self regulation problem as an inexact steepest descent method for multicriteria optimization (Q2256314) (← links)
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems (Q2301136) (← links)
- Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions (Q2322832) (← links)
- Newton-like methods for efficient solutions in vector optimization (Q2377172) (← links)
- Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm (Q2675732) (← links)
- Newton-like methods for solving vector optimization problems (Q2875559) (← links)
- Steepest descent methods for critical points in vector optimization problems (Q3143359) (← links)
- Generalized Proximal Method for Efficient Solutions in Vector Optimization (Q3173507) (← links)
- The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem (Q4637508) (← links)
- Nonlinear Conjugate Gradient Methods for Vector Optimization (Q4687237) (← links)
- On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm (Q5151507) (← links)
- Parallel proximal point methods for systems of vector optimization problems on Hadamard manifolds without convexity (Q5213375) (← links)
- A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization (Q6051171) (← links)