Inertial forward–backward methods for solving vector optimization problems
From MaRDI portal
Publication:3177614
Recommendations
- New inertial forward-backward algorithm for convex minimization with applications
- A dynamical approach to an inertial forward-backward algorithm for convex minimization
- Contiuous time inverse vector optimization problems
- Inertial variable metric techniques for the inexact forward-backward algorithm
- A forward-backward algorithm with different inertial terms for structured non-convex minimization problems
- An inertial forward-backward algorithm for monotone inclusions
- scientific article; zbMATH DE number 7267094
- Inertial extragradient algorithms for solving equilibrium problems
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Inertial hybrid algorithm for variational inequality problems in Hilbert spaces
Cites work
- A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A primal-dual splitting algorithm for finding zeros of sums of maximal monotone operators
- A projected gradient method for vector optimization problems
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- An interior proximal method in vector optimization
- Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- Convergence of a splitting inertial proximal method for monotone operators
- Convex analysis and monotone operator theory in Hilbert spaces
- Duality in Vector Optimization
- Equilibrium analysis in financial markets with countably many securities
- Inertial proximal point regularization algorithm for unconstrained vector convex optimization problems
- Newton's method for multiobjective optimization
- On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
- On the choice of parameters for the weighting method in vector optimization
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- Proximal Methods in Vector Optimization
- Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
- Vector optimization and monotone operators via convex duality. Recent advances
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(11)- Contiuous time inverse vector optimization problems
- The generalized conditional gradient method for composite multiobjective optimization problems on Riemannian manifolds
- Convergence rates analysis of a multiobjective proximal gradient method
- A proximal gradient splitting method for solving convex vector optimization problems
- A descent method for nonsmooth multiobjective optimization in Hilbert spaces
- Conditional gradient method for vector optimization
- Inertial version of generalized projected reflected gradient method
- A new approach to strong duality for composite vector optimization problems
- A strongly convergent proximal point method for vector optimization
- An accelerated proximal gradient method for multiobjective optimization
- scientific article; zbMATH DE number 7267094 (Why is no real title available?)
This page was built for publication: Inertial forward–backward methods for solving vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177614)
