Pages that link to "Item:Q2475812"

The following pages link to Box-constrained multi-objective optimization: A gradient-like method without ``a priori'' scalarization (Q2475812):

Displaying 28 items.

• Improving the identification of general Pareto fronts by global optimization (Q1009544) (← links)
• A path following method for box-constrained multiobjective optimization with applications to goal programming problems (Q1423708) (← links)
• From bond yield to macroeconomic instability: a parsimonious affine model (Q1683157) (← links)
• Conditional gradient method for multiobjective optimization (Q2028470) (← links)
• A sequential quadratic programming method for constrained multi-objective optimization problems (Q2053082) (← links)
• Globally convergent Newton-type methods for multiobjective optimization (Q2082544) (← links)
• A study of Liu-Storey conjugate gradient methods for vector optimization (Q2139818) (← links)
• A quasi-Newton method with Wolfe line searches for multiobjective optimization (Q2159465) (← links)
• On the extension of the Hager-Zhang conjugate gradient method for vector optimization (Q2191796) (← links)
• The self regulation problem as an inexact steepest descent method for multicriteria optimization (Q2256314) (← links)
• A new scalarization method for finding the efficient frontier in non-convex multi-objective problems (Q2285911) (← links)
• Memory gradient method for multiobjective optimization (Q2700431) (← links)
• A limited memory quasi-Newton approach for multi-objective optimization (Q2701416) (← links)
• Solving generalized convex multiobjective programming problems by a normal direction method (Q2836102) (← links)
• A gradient like algorithm for linearly constrained multi-objective optimization (Q2892428) (← links)
• A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems (Q3112505) (← links)
• Steepest descent methods for critical points in vector optimization problems (Q3143359) (← links)
• Inertial forward–backward methods for solving vector optimization problems (Q3177614) (← links)
• A modified Quasi-Newton method for vector optimization problem (Q3453403) (← links)
• Nonlinear Conjugate Gradient Methods for Vector Optimization (Q4687237) (← links)
• Using first-order information in direct multisearch for multiobjective optimization (Q5058408) (← links)
• A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization (Q5859003) (← links)
• Spectral conjugate gradient methods for vector optimization problems (Q6051300) (← links)
• Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization (Q6498413) (← links)
• Accelerated nonmonotone line search technique for multiobjective optimization (Q6593954) (← links)
• On the extension of Dai-Liao conjugate gradient method for vector optimization (Q6636812) (← links)
• A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization (Q6642792) (← links)
• A PRP type conjugate gradient method without truncation for nonconvex vector optimization (Q6661704) (← links)