Pages that link to "Item:Q1765484"

The following pages link to A steepest descent method for vector optimization (Q1765484):

Displaying 45 items.

• Box-constrained multi-objective optimization: A gradient-like method without ``a priori'' scalarization (Q2475812) (← links)
• Explicit gradient information in multiobjective optimization (Q2517803) (← links)
• Barzilai and Borwein's method for multiobjective optimization problems (Q2630749) (← links)
• Two methods for studying the response and the reliability of a fractional stochastic dynamical system (Q2700206) (← links)
• A limited memory quasi-Newton approach for multi-objective optimization (Q2701416) (← links)
• Trust region methods for solving multiobjective optimisation (Q2867408) (← links)
• Newton-like methods for solving vector optimization problems (Q2875559) (← links)
• Multi Agent Collaborative Search (Q2958244) (← links)
• On the convergence of the projected gradient method for vector optimization (Q3112500) (← links)
• Steepest descent methods for critical points in vector optimization problems (Q3143359) (← links)
• Generalized Proximal Method for Efficient Solutions in Vector Optimization (Q3173507) (← links)
• A modified Quasi-Newton method for vector optimization problem (Q3453403) (← links)
• Weak efficiency in multiobjective quasiconvex optimization on the real-line without derivatives (Q3622009) (← links)
• A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization (Q4634096) (← links)
• The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem (Q4637508) (← links)
• Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization (Q4639123) (← links)
• Nonlinear Conjugate Gradient Methods for Vector Optimization (Q4687237) (← links)
• Improving integral square error performance with implementable fractional‐order PI controllers (Q4979583) (← links)
• A proximal gradient splitting method for solving convex vector optimization problems (Q5034925) (← links)
• A steepest descent-like method for vector optimization problems with variable domination structure (Q5052577) (← links)
• Some properties of <i>K</i>-convex mappings in variable ordering settings (Q5057971) (← links)
• A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem (Q5058916) (← links)
• Efficiency in quasiconvex multiobjective nondifferentiable optimization on the real line (Q5067342) (← links)
• A conjugate directions-type procedure for quadratic multiobjective optimization (Q5067349) (← links)
• Approximate elements for set optimization problems with respect to variable domination structures (Q5088837) (← links)
• A Globally Convergent SQCQP Method for Multiobjective Optimization Problems (Q5148405) (← links)
• A barrier-type method for multiobjective optimization (Q5151514) (← links)
• A quadratically convergent Newton method for vector optimization (Q5169449) (← links)
• A New Predictor Corrector Variant for Unconstrained Bi-objective Optimization Problems (Q5176393) (← links)
• Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis (Q5234284) (← links)
• Multiple-gradient Descent Algorithm for Pareto-Front Identification (Q5259697) (← links)
• On sequential optimality conditions for smooth constrained optimization (Q5894295) (← links)
• Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem (Q6050365) (← links)
• Spectral conjugate gradient methods for vector optimization problems (Q6051300) (← links)
• Vectorial penalisation in vector optimisation in real linear-topological spaces (Q6085811) (← links)
• Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets (Q6085818) (← links)
• Convergence rates of the stochastic alternating algorithm for bi-objective optimization (Q6108978) (← links)
• Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints (Q6108979) (← links)
• Twenty years of continuous multiobjective optimization in the twenty-first century (Q6114911) (← links)
• Conditional gradient method for vector optimization (Q6133299) (← links)
• An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation (Q6133674) (← links)
• An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems (Q6164611) (← links)
• Nonlinear Cone Separation Theorems in Real Topological Linear Spaces (Q6177388) (← links)
• Density function-based trust region algorithm for approximating Pareto front of black-box multiobjective optimization problems (Q6190800) (← links)
• Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization (Q6498413) (← links)