Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
From MaRDI portal
Publication:604261
DOI10.1007/S10957-010-9667-4zbMATH Open1251.90388OpenAlexW2044903028MaRDI QIDQ604261FDOQ604261
Boris S. Mordukhovich, Jen-Chih Yao, L. C. Ceng
Publication date: 10 November 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.wayne.edu/math_reports/63
Banach spacesvector optimizationproximal pointsauxiliary variational inequalitieshybrid inexact algorithms
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Optimality conditions (49K99) Programming in abstract spaces (90C48) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A proximal-based deomposition method for compositions method for convex minimization problems
- Enlargement of monotone operators with applications to variational inequalities
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Forcing strong convergence of proximal point iterations in a Hilbert space
- Weak and strong convergence to fixed points of asymptotically nonexpansive mappings
- Counterexamples Concerning Support Theorems for Convex Sets in Hilbert Space
- Monotone Operators and the Proximal Point Algorithm
- Approximate iterations in Bregman-function-based proximal algorithms
- Approximate proximal methods in vector optimization
- Set-valued mappings and enlargement of monotone operators.
- Strong Convergence Theorem by a Hybrid Method for Nonexpansive Mappings and Lipschitz-Continuous Monotone Mappings
- On the Maximality of Sums of Nonlinear Monotone Operators
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Inexact implicit methods for monotone general variational inequalities
- Rescaling and stepsize selection in proximal methods using separable generalized distances
- An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
- Proximal Methods in Vector Optimization
- Steepest descent methods for multicriteria optimization.
- A steepest descent method for vector optimization
- A projected gradient method for vector optimization problems
- An Outer Approximation Method for the Variational Inequality Problem
- Robustness of the hybrid extragradient proximal-point algorithm.
- Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
- An Existence Theorem in Vector Optimization
- Nonlinear proximal decomposition method for convex programming
- An implicit iterative scheme for monotone variational inequalities and fixed point problems
- On a proximal point method for convex optimization in banach spaces
Cited In (35)
- An inertial Popov's method for solving pseudomonotone variational inequalities
- Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Steepest descent methods for critical points in vector optimization problems
- On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds
- Title not available (Why is that?)
- Tikhonov-type regularization method for efficient solutions in vector optimization
- A proximal point-type method for multicriteria optimization
- On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects
- Generalized Proximal Method for Efficient Solutions in Vector Optimization
- A study of Liu-Storey conjugate gradient methods for vector optimization
- A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Hybrid proximal methods for equilibrium problems
- On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems
- Inexact proximal point methods in metric spaces
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm
- Newton-like methods for efficient solutions in vector optimization
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- A strongly convergent proximal point method for vector optimization
- Newton-like methods for solving vector optimization problems
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
- An abstract proximal point algorithm
- Convergence of the projection and contraction methods for solving bilevel variational inequality problems
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization
- Parallel proximal point methods for systems of vector optimization problems on Hadamard manifolds without convexity
- 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
- The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization
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)
