Inertial forward–backward methods for solving vector optimization problems
From MaRDI portal
Publication:3177614
DOI10.1080/02331934.2018.1440553zbMath1402.90163OpenAlexW2790326975WikidataQ90218530 ScholiaQ90218530MaRDI QIDQ3177614
Sorin-Mihai Grad, Radu Ioan Boţ
Publication date: 1 August 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1440553
vector optimization problemsweakly efficient solutionsforward-backward algorithmsinertial proximal algorithms
Multi-objective and goal programming (90C29) Interior-point methods (90C51) Programming in abstract spaces (90C48)
Related Items (7)
A proximal gradient splitting method for solving convex vector optimization problems ⋮ An accelerated proximal gradient method for multiobjective optimization ⋮ The generalized conditional gradient method for composite multiobjective optimization problems on Riemannian manifolds ⋮ Conditional gradient method for vector optimization ⋮ Convergence rates analysis of a multiobjective proximal gradient method ⋮ A strongly convergent proximal point method for vector optimization ⋮ A new approach to strong duality for composite vector optimization problems
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- An interior proximal method in vector optimization
- Equilibrium analysis in financial markets with countably many securities
- Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
- Convergence of a splitting inertial proximal method for monotone operators
- A projected gradient method for vector optimization problems
- On the choice of parameters for the weighting method in vector optimization
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- Vector Optimization and Monotone Operators via Convex Duality
- Inertial proximal point regularization algorithm for unconstrained vector convex optimization problems
- Duality in Vector Optimization
- Newton's Method for Multiobjective Optimization
- On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
- Proximal Methods in Vector Optimization
- A Primal-Dual Splitting Algorithm for Finding Zeros of Sums of Maximal Monotone Operators
- A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
- Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Convex analysis and monotone operator theory in Hilbert spaces
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
This page was built for publication: Inertial forward–backward methods for solving vector optimization problems
