Steepest descent methods for multicriteria optimization.
From MaRDI portal
Recommendations
- A steepest descent method for vector optimization
- On the convergence of steepest descent methods for multiobjective optimization
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- Steepest descent methods for critical points in vector optimization problems
- Steepest ascent algorithms for nonconical multiple objective programming
Cited in
(only showing first 100 items - show all)- Newton-like methods for efficient solutions in vector optimization
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- On high-order model regularization for multiobjective optimization
- Multi-objective optimal design of feedback controls for dynamical systems with hybrid simple cell mapping algorithm
- A Barzilai-Borwein descent method for multiobjective optimization problems
- Altruistic agents in uncertain dynamic games
- Charnes-Cooper scalarization and convex vector optimization
- Hybrid proximal point algorithm for solution of convex multiobjective optimization problem over fixed point constraint
- Complexity of gradient descent for multiobjective optimization
- Multiple reduced gradient method for multiobjective optimization problems
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
- Multiobjective conjugate gradient methods on Riemannian manifolds
- A weighting subgradient algorithm for multiobjective optimization
- A unifying convex analysis and switching system approach to consensus with undirected communication graphs
- Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components
- Extension of Zoutendijk method for solving constrained multiobjective optimization problems
- An augmented Lagrangian algorithm for multi-objective optimization
- On the convergence of steepest descent methods for multiobjective optimization
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- On some properties and an application of the logarithmic barrier method
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- Adjoint-assisted Pareto front tracing in aerodynamic and conjugate heat transfer shape optimization
- Conditional gradient method for multiobjective optimization
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints
- Newton-like methods for solving vector optimization problems
- Barzilai and Borwein's method for multiobjective optimization problems
- Globally convergent Newton-type methods for multiobjective optimization
- Pareto front approximation through a multi-objective augmented Lagrangian method
- Steepest ascent algorithms for nonconical multiple objective programming
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- GivEn -- shape optimization for gas turbines in volatile energy networks
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- A proximal gradient splitting method for solving convex vector optimization problems
- Gradient based biobjective shape optimization to improve reliability and cost of ceramic components
- Explicit gradient information in multiobjective optimization
- Efficient and sparse neural networks by pruning weights in a multiobjective learning approach
- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
- A cutting-plane method to nonsmooth multiobjective optimization problems
- Adaptive trust region scheme for multi-objective optimization problem using Geršgorin circle theorem
- The gradient subspace approximation and its application to bi-objective optimization problems
- A sequential quadratic programming method for constrained multi-objective optimization problems
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- A modified Quasi-Newton method for vector optimization problem
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- Conditional gradient method for vector optimization
- Nonsmooth steepest descent method by proximal subdifferentials in Hilbert spaces
- The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
- Multiple-gradient descent algorithm for Pareto-front identification
- Multiple sparse measurement gradient reconstruction algorithm for DOA estimation in compressed sensing
- A multiobjective steepest descent method with applications to optimal well control
- A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization
- Accelerated diagonal steepest descent method for unconstrained multiobjective optimization
- A strongly convergent proximal point method for vector optimization
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
- Accuracy and fairness trade-offs in machine learning: a stochastic multi-objective approach
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- A subgradient method for multiobjective optimization on Riemannian manifolds
- On the convergence of the projected gradient method for vector optimization
- Proximal gradient methods for multiobjective optimization and their applications
- An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints
- Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- A quadratically convergent Newton method for vector optimization
- Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- A subgradient method for multiobjective optimization
- A trust-region method for unconstrained multiobjective problems with applications in satisficing processes
- Multicriteria optimization with a multiobjective golden section line search
- Generalized proximal method for efficient solutions in vector optimization
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- An adaptive direct multisearch method for black-box multi-objective optimization
- A barrier-type method for multiobjective optimization
- A steepest descent-like method for variable order vector optimization problems
- Generalized proximal point algorithms for multiobjective optimization problems
- A steepest descent method for vector optimization
- Tikhonov-type regularization method for efficient solutions in vector optimization
- Inexact projected gradient method for vector optimization
- Quasi-Newton methods for multiobjective optimization problems
- An accelerated augmented Lagrangian method for multi-criteria optimization problem
- A relaxed projection method for solving multiobjective optimization problems
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- Proximal Methods with Penalization Effects in Banach Spaces
- A Levenberg-Marquardt algorithm for unconstrained multicriteria optimization
- Explicit multiobjective model predictive control for nonlinear systems under uncertainty
- Improved front steepest descent for multi-objective optimization
- A steepest descent-like method for vector optimization problems with variable domination structure
- A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
- Steepest descent methods for critical points in vector optimization problems
- A proximal point-type method for multicriteria optimization
- On \(q\)-steepest descent method for unconstrained multiobjective optimization problems
- A multi-objective approach to the design of low thrust space trajectories using optimal control
- A local multiobjective optimization algorithm using neighborhood field
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
- Reduced Jacobian method
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
This page was built for publication: Steepest descent methods for multicriteria optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1403179)