Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
From MaRDI portal
Publication:604261
Recommendations
- scientific article; zbMATH DE number 7426954
- Hybrid approximate proximal algorithms for efficient solutions in vector optimization
- Approximate proximal methods in vector optimization
- Generalized contractions and hybrid approximate proximal method for vector optimization problems
- Proximal Methods in Vector Optimization
Cites work
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 1086936 (Why is no real title available?)
- scientific article; zbMATH DE number 1369459 (Why is no real title available?)
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A projected gradient method for vector optimization problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- A steepest descent method for vector optimization
- An Existence Theorem in Vector Optimization
- An Outer Approximation Method for the Variational Inequality Problem
- An implicit iterative scheme for monotone variational inequalities and fixed point problems
- An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
- Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
- Approximate iterations in Bregman-function-based proximal algorithms
- Approximate proximal methods in vector optimization
- Counterexamples Concerning Support Theorems for Convex Sets in Hilbert Space
- Enlargement of monotone operators with applications to variational inequalities
- Forcing strong convergence of proximal point iterations in a Hilbert space
- Inexact implicit methods for monotone general variational inequalities
- Monotone Operators and the Proximal Point Algorithm
- Nonlinear proximal decomposition method for convex programming
- On a proximal point method for convex optimization in banach spaces
- On the Maximality of Sums of Nonlinear Monotone Operators
- Proximal Methods in Vector Optimization
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Rescaling and stepsize selection in proximal methods using separable generalized distances
- Robustness of the hybrid extragradient proximal-point algorithm.
- Set-valued mappings and enlargement of monotone operators.
- Steepest descent methods for multicriteria optimization.
- Strong Convergence Theorem by a Hybrid Method for Nonexpansive Mappings and Lipschitz-Continuous Monotone Mappings
- Weak and strong convergence to fixed points of asymptotically nonexpansive mappings
Cited in
(38)- On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems
- Inexact proximal point methods in metric spaces
- Newton-like methods for efficient solutions in vector optimization
- A study of Liu-Storey conjugate gradient methods for vector optimization
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- Generalized proximal method for efficient solutions in vector optimization
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- An inertial Popov's method for solving pseudomonotone variational inequalities
- An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- 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
- Tikhonov-type regularization method for efficient solutions in vector optimization
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- Newton-like methods for solving vector optimization problems
- Steepest descent methods for critical points in vector optimization problems
- Convergence of the projection and contraction methods for solving bilevel variational inequality problems
- A proximal point-type method for multicriteria optimization
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- Hybrid approximate proximal algorithms for efficient solutions in vector optimization
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
- On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Hybrid proximal methods for equilibrium problems
- Approximate proximal methods in vector optimization
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds
- Generalized contractions and hybrid approximate proximal method for vector optimization problems
- A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors
- Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
- A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm
- An abstract proximal point algorithm
- A strongly convergent proximal point method for vector optimization
- Parallel proximal point methods for systems of vector optimization problems on Hadamard manifolds without convexity
- scientific article; zbMATH DE number 7426954 (Why is no real title available?)
This page was built for publication: Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604261)
