Inexact projected gradient method for vector optimization

From MaRDI portal
Publication:2377166

DOI10.1007/s10589-012-9501-zzbMath1295.90069OpenAlexW2064114515MaRDI QIDQ2377166

Ellen H. Fukuda, L. M. Graña Drummond

Publication date: 28 June 2013

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-012-9501-z




Related Items

Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualificationsGeometric Duality Results and Approximation Algorithms for Convex Vector Optimization ProblemsAn external penalty-type method for multicriteriaOn inexact projected gradient methods for solving variable vector optimization problemsA study of Liu-Storey conjugate gradient methods for vector optimizationA penalty decomposition approach for multi-objective cardinality-constrained optimization problemsA quasi-Newton method with Wolfe line searches for multiobjective optimizationAn inexact steepest descent method for multicriteria optimization on Riemannian manifoldsProximal point method for vector optimization on Hadamard manifoldsThe multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuousAugmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problemAn accelerated proximal gradient method for multiobjective optimizationSpectral conjugate gradient methods for vector optimization problemsOn the extension of the Hager-Zhang conjugate gradient method for vector optimizationConvergence rates of the stochastic alternating algorithm for bi-objective optimizationConvergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraintsConditional gradient method for vector optimizationNonmonotone gradient methods for vector optimization with a portfolio optimization applicationMultiobjective BFGS method for optimization on Riemannian manifoldsAn infeasible interior-point technique to generate the nondominated set for multiobjective optimization problemsMultiobjective conjugate gradient methods on Riemannian manifoldsA memetic procedure for global multi-objective optimizationMultiple subgradient descent bundle method for convex nonsmooth multiobjective optimizationA barrier-type method for multiobjective optimizationA weighting subgradient algorithm for multiobjective optimizationA relaxed projection method for solving multiobjective optimization problemsThe self regulation problem as an inexact steepest descent method for multicriteria optimizationConditional gradient method for multiobjective optimizationNonlinear Conjugate Gradient Methods for Vector OptimizationA proximal point-type method for multicriteria optimizationIteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifoldsA sequential quadratic programming method for constrained multi-objective optimization problemsGlobally convergent Newton-type methods for multiobjective optimizationAn augmented Lagrangian algorithm for multi-objective optimizationConvergence analysis of a nonmonotone projected gradient method for multiobjective optimization problemsNewton-like methods for solving vector optimization problems


Uses Software


Cites Work