Pages that link to "Item:Q5317531"
From MaRDI portal
The following pages link to Proximal Methods in Vector Optimization (Q5317531):
Displayed 50 items.
- Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces (Q288117) (← links)
- Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions (Q289089) (← links)
- An external penalty-type method for multicriteria (Q301402) (← links)
- A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application (Q319989) (← links)
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds (Q382906) (← links)
- A subgradient method for multiobjective optimization on Riemannian manifolds (Q382921) (← links)
- A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces (Q456993) (← links)
- A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions (Q458364) (← links)
- A steepest descent-like method for variable order vector optimization problems (Q467437) (← links)
- A proximal point algorithm with quasi-distance in multi-objective optimization (Q504811) (← links)
- An algorithm for vector optimization problems (Q523236) (← links)
- Generalized viscosity approximation methods in multiobjective optimization problems (Q540628) (← links)
- Convergence of the projected gradient method for quasiconvex multiobjective optimization (Q555040) (← links)
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization (Q604261) (← links)
- A logarithmic-quadratic proximal point scalarization method for multiobjective programming (Q625652) (← links)
- An interior proximal method in vector optimization (Q635150) (← links)
- Logarithmic quasi-distance proximal point scalarization method for multi-objective programming (Q668555) (← links)
- Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency (Q691494) (← links)
- Hybrid proximal methods for equilibrium problems (Q694191) (← links)
- A proximal point-type method for multicriteria optimization (Q741360) (← links)
- An augmented Lagrangian algorithm for multi-objective optimization (Q782908) (← links)
- Charnes-Cooper scalarization and convex vector optimization (Q828709) (← links)
- A scalarization proximal point method for quasiconvex multiobjective minimization (Q905757) (← links)
- Tikhonov-type regularization method for efficient solutions in vector optimization (Q966089) (← links)
- Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces (Q971618) (← links)
- Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems (Q1021502) (← links)
- Multiple reduced gradient method for multiobjective optimization problems (Q1625772) (← links)
- Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases (Q1626523) (← links)
- Reduced Jacobian method (Q1626533) (← links)
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← links)
- An abstract proximal point algorithm (Q1630279) (← links)
- Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems (Q1637356) (← links)
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application (Q1694908) (← links)
- Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds (Q1730797) (← links)
- Proximal point method for a special class of nonconvex multiobjective optimization functions (Q1744628) (← links)
- A relaxed projection method for solving multiobjective optimization problems (Q1752157) (← links)
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds (Q1762393) (← links)
- Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels (Q1784885) (← links)
- Asymptotic analysis in convex composite multiobjective optimization problems (Q1945516) (← links)
- An efficient descent method for locally Lipschitz multiobjective optimization problems (Q2031935) (← links)
- A strongly convergent proximal point method for vector optimization (Q2046562) (← links)
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data (Q2066220) (← links)
- Globally convergent Newton-type methods for multiobjective optimization (Q2082544) (← links)
- Combined gradient methods for multiobjective optimization (Q2089219) (← links)
- Extragradient method with Bregman distances for solving vector quasi-equilibrium problems (Q2099527) (← links)
- On inexact projected gradient methods for solving variable vector optimization problems (Q2138300) (← links)
- A study of Liu-Storey conjugate gradient methods for vector optimization (Q2139818) (← links)
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems (Q2150773) (← links)
- A quasi-Newton method with Wolfe line searches for multiobjective optimization (Q2159465) (← links)
- Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications (Q2178574) (← links)