A steepest descent method for vector optimization
From MaRDI portal
Publication:1765484
DOI10.1016/J.CAM.2004.06.018zbMATH Open1058.90060OpenAlexW2052471135MaRDI QIDQ1765484FDOQ1765484
Authors: L. M. Graña Drummond, B. F. 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
Recommendations
- Steepest descent methods for multicriteria optimization.
- Steepest descent methods for critical points in vector optimization problems
- A steepest descent-like method for variable order vector optimization problems
- A steepest descent-like method for vector optimization problems with variable domination structure
- Nonlinear Conjugate Gradient Methods for Vector Optimization
multi-objective optimizationPareto optimalityvector optimizationsteepest descent\(K\)-convexityquasi-Féjer convergence
Cites Work
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Title not available (Why is that?)
- Nonlinear multiobjective optimization
- Title not available (Why is that?)
- Proper efficiency and the theory of vector maximization
- Title not available (Why is that?)
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Title not available (Why is that?)
- Dominating sets for convex functions with some applications
- Entropy-Like Proximal Methods in Convex Programming
- Epsilon-dominating solutions in mean-variance portfolio analysis
- Steepest descent methods for multicriteria optimization.
- Title not available (Why is that?)
- Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus§
- Full convergence of the steepest descent method with inexact line searches
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
- General equilibrium analysis in ordered topological vector spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Equilibrium analysis in financial markets with countably many securities
Cited In (only showing first 100 items - show all)
- Trust region methods for solving multiobjective optimisation
- On \(q\)-steepest descent method for unconstrained multiobjective optimization problems
- Conditional gradient method for vector optimization
- Accelerated diagonal steepest descent method for unconstrained multiobjective optimization
- Generalized proximal method for efficient solutions in vector optimization
- Extension of Zoutendijk method for solving constrained multiobjective optimization problems
- An existence result for the generalized vector equilibrium problem on Hadamard manifolds
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- Generalized viscosity approximation methods in multiobjective optimization problems
- Steepest descent methods for critical points in vector optimization problems
- Bi-objective hypervolume-based Pareto optimization
- A subgradient method for multiobjective optimization on Riemannian manifolds
- Multiple reduced gradient method for multiobjective optimization problems
- Barzilai and Borwein's method for multiobjective optimization problems
- Quasi-Newton's method for multiobjective optimization
- 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
- An interior proximal method in vector optimization
- A quadratically convergent Newton method for vector optimization
- A steepest descent-like method for variable order vector optimization problems
- Tikhonov-type regularization method for efficient solutions in vector optimization
- A proximal point-type method for multicriteria optimization
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- An external penalty-type method for multicriteria
- Conditional gradient method for multiobjective optimization
- Proximal point method for vector optimization on Hadamard manifolds
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Spectral conjugate gradient methods for vector optimization problems
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- A steepest descent-like method for vector optimization problems with variable domination structure
- A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces
- A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions
- Explicit gradient information in multiobjective optimization
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Multiple-gradient descent algorithm for Pareto-front identification
- Newton-like methods for efficient solutions in vector optimization
- Title not available (Why is that?)
- A relaxed projection method for solving multiobjective optimization problems
- Approximate proximal methods in vector optimization
- Nonsmooth steepest descent method by proximal subdifferentials in Hilbert spaces
- On sequential optimality conditions for smooth constrained optimization
- A New Predictor Corrector Variant for Unconstrained Bi-objective Optimization Problems
- Quadratic scalarization for decomposed multiobjective optimization
- Combined gradient methods for multiobjective optimization
- Steepest descent methods for multicriteria optimization.
- A Wolfe Line Search Algorithm for Vector Optimization
- A barrier-type method for multiobjective optimization
- Newton-like methods for solving vector optimization problems
- Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds
- A modified Quasi-Newton method for vector optimization problem
- Some properties of \(K\)-convex mappings in variable ordering settings
- On some properties and an application of the logarithmic barrier method
- On the convergence of steepest descent methods for multiobjective optimization
- Multi agent collaborative search based on Tchebycheff decomposition
- Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- A subgradient method for multiobjective optimization
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization
- A \(p\)-adaptive scaled boundary finite element method based on maximization of the error decrease rate
- Inexact projected gradient method for vector optimization
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- Quasi-Newton methods for multiobjective optimization problems
- A cutting-plane method to nonsmooth multiobjective optimization problems
- On the convergence of the projected gradient method for vector optimization
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization
- Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
- A line search technique for a class of multi-objective optimization problems using subgradient
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- A proximal gradient splitting method for solving convex vector optimization problems
- A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
- Approximate elements for set optimization problems with respect to variable domination structures
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
- Multi agent collaborative search
- Twenty years of continuous multiobjective optimization in the twenty-first century
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
- Accelerated nonmonotone line search technique for multiobjective optimization
- The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learning
- On inexact projected gradient methods for solving variable vector optimization problems
- Solving optimal control problems governed by nonlinear PDEs using a multilevel method based on an artificial neural network
- Expensive multi-objective optimization of electromagnetic mixing in a liquid metal
- A study of Liu-Storey conjugate gradient methods for vector optimization
- Nonlinear Cone Separation Theorems in Real Topological Linear Spaces
- Improving integral square error performance with implementable fractional-order PI controllers
- Efficiency in quasiconvex multiobjective nondifferentiable optimization on the real line
- Density function-based trust region algorithm for approximating Pareto front of black-box multiobjective optimization problems
- Convergence rates of the stochastic alternating algorithm for bi-objective optimization
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- A strongly convergent proximal point method for vector optimization
- A unified characterization of nonlinear scalarizing functionals in optimization
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets
- On the extension of Dai-Liao conjugate gradient method for vector optimization
- Bilevel optimization with a multi-objective lower-level problem: risk-neutral and risk-averse formulations
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- A unified scheme for scalarization in set optimization
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
Uses Software
This page was built for publication: A steepest descent method for vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765484)
