A steepest descent method for vector optimization
From MaRDI portal
Publication:1765484
DOI10.1016/j.cam.2004.06.018zbMath1058.90060OpenAlexW2052471135MaRDI QIDQ1765484
L. M. Graña Drummond, Benar Fux Svaiter
Publication date: 23 February 2005
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2004.06.018
vector optimizationmulti-objective optimizationPareto optimalitysteepest descentquasi-Féjer convergence\(K\)-convexity
Related Items
A proximal gradient splitting method for solving convex vector optimization problems, Multiple reduced gradient method for multiobjective optimization problems, On \(q\)-steepest descent method for unconstrained multiobjective optimization problems, Approximate proximal methods in vector optimization, An external penalty-type method for multicriteria, On inexact projected gradient methods for solving variable vector optimization problems, Expensive multi-objective optimization of electromagnetic mixing in a liquid metal, Generalized Proximal Method for Efficient Solutions in Vector Optimization, A steepest descent-like method for vector optimization problems with variable domination structure, Barzilai and Borwein's method for multiobjective optimization problems, A study of Liu-Storey conjugate gradient methods for vector optimization, A modified Quasi-Newton method for vector optimization problem, A subgradient method for multiobjective optimization, Inexact projected gradient method for vector optimization, Newton-like methods for efficient solutions in vector optimization, Some properties of K-convex mappings in variable ordering settings, A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem, Quadratic scalarization for decomposed multiobjective optimization, Efficiency in quasiconvex multiobjective nondifferentiable optimization on the real line, A conjugate directions-type procedure for quadratic multiobjective optimization, A quasi-Newton method with Wolfe line searches for multiobjective optimization, Multi agent collaborative search based on Tchebycheff decomposition, Hybrid approximate proximal method with auxiliary variational inequality for vector optimization, Approximate elements for set optimization problems with respect to variable domination structures, An inexact steepest descent method for multicriteria optimization on Riemannian manifolds, A subgradient method for multiobjective optimization on Riemannian manifolds, Proximal point method for vector optimization on Hadamard manifolds, Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem, Spectral conjugate gradient methods for vector optimization problems, Vectorial penalisation in vector optimisation in real linear-topological spaces, Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets, On the extension of the Hager-Zhang conjugate gradient method for vector optimization, An existence result for the generalized vector equilibrium problem on Hadamard manifolds, Convergence rates of the stochastic alternating algorithm for bi-objective optimization, Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints, Twenty years of continuous multiobjective optimization in the twenty-first century, Multi Agent Collaborative Search, Conditional gradient method for vector optimization, An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation, An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems, Nonlinear Cone Separation Theorems in Real Topological Linear Spaces, Density function-based trust region algorithm for approximating Pareto front of black-box multiobjective optimization problems, An interior proximal method in vector optimization, Two methods for studying the response and the reliability of a fractional stochastic dynamical system, A limited memory quasi-Newton approach for multi-objective optimization, A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces, A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions, A cutting-plane method to nonsmooth multiobjective optimization problems, A steepest descent-like method for variable order vector optimization problems, Quasi-Newton methods for multiobjective optimization problems, A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization, A steepest descent method for set optimization problems with set-valued mappings of finite cardinality, A Globally Convergent SQCQP Method for Multiobjective Optimization Problems, The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem, Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization, Bi-objective hypervolume-based Pareto optimization, A barrier-type method for multiobjective optimization, On some properties and an application of the logarithmic barrier method, Extension of Zoutendijk method for solving constrained multiobjective optimization problems, Nonsmooth steepest descent method by proximal subdifferentials in Hilbert spaces, A relaxed projection method for solving multiobjective optimization problems, Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds, Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization, Quasi-Newton's method for multiobjective optimization, A quadratically convergent Newton method for vector optimization, The self regulation problem as an inexact steepest descent method for multicriteria optimization, Tikhonov-type regularization method for efficient solutions in vector optimization, Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds, Generalized viscosity approximation methods in multiobjective optimization problems, A New Predictor Corrector Variant for Unconstrained Bi-objective Optimization Problems, Convergence of the projected gradient method for quasiconvex multiobjective optimization, Accelerated diagonal steepest descent method for unconstrained multiobjective optimization, Conditional gradient method for multiobjective optimization, Nonlinear Conjugate Gradient Methods for Vector Optimization, Explicit gradient information in multiobjective optimization, Weak efficiency in multiobjective quasiconvex optimization on the real-line without derivatives, A proximal point-type method for multicriteria optimization, A strongly convergent proximal point method for vector optimization, On sequential optimality conditions for smooth constrained optimization, A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems, On \(q\)-Newton's method for unconstrained multiobjective optimization problems, Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds, A \(p\)-adaptive scaled boundary finite element method based on maximization of the error decrease rate, Improving integral square error performance with implementable fractional‐order PI controllers, Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis, On the convergence of the projected gradient method for vector optimization, Globally convergent Newton-type methods for multiobjective optimization, On the convergence of steepest descent methods for multiobjective optimization, A unified characterization of nonlinear scalarizing functionals in optimization, Combined gradient methods for multiobjective optimization, Multiple-gradient Descent Algorithm for Pareto-Front Identification, Trust region methods for solving multiobjective optimisation, Steepest descent methods for critical points in vector optimization problems, Newton-like methods for solving vector optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equilibrium analysis in financial markets with countably many securities
- Epsilon-dominating solutions in mean-variance portfolio analysis
- Nonlinear multiobjective optimization
- Dominating sets for convex functions with some applications
- Steepest descent methods for multicriteria optimization.
- General equilibrium analysis in ordered topological vector spaces
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
- Proper efficiency and the theory of vector maximization
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Entropy-Like Proximal Methods in Convex Programming
- Full convergence of the steepest descent method with inexact line searches
- Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus§
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
