Multicriteria optimization with a multiobjective golden section line search
From MaRDI portal
Recommendations
- Global search perspectives for multiobjective optimization
- An adaptive nonmonotone line search for multiobjective optimization problems
- A gradient-based search method for multi-objective optimization problems
- On some schemes for multicriterion optimization
- A systematic approach to multiobjective optimization
- scientific article; zbMATH DE number 18726
- Multicriteria optimization
- scientific article; zbMATH DE number 4216623
- A Hybrid Approach to Multi-objective Linear Optimization
Cites work
- A Necessary and Sufficient Qualification for Constrained Optimization
- A survey of generalized goal programming (1970-1982)
- A unified approach for characterizing Pareto optimal solutions of multiobjective optimization problems: The hyperplane method
- Cone characterizations of approximate solutions in real vector optimization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Convergence of stochastic search algorithms to finite size Pareto set approximations
- Covering Pareto sets by multilevel subdivision techniques
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Existence of efficient solutions for vector maximization problems
- Fast computation of equispaced Pareto manifolds and Pareto fronts for multiobjective optimization problems
- Gap-free computation of Pareto-points by quadratic scalarizations
- Generalized homotopy approach to multiobjective optimization.
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 2045443 (Why is no real title available?)
- Multi-objective optimization using evolutionary algorithms
- Newton's method for multiobjective optimization
- Nonsmooth vector functions and continuous optimization
- On the characterization of noninferior solutions of the vector optimization problem
- Steepest descent methods for multicriteria optimization.
- Stochastic method for the solution of unconstrained vector optimization problems
- Unbiased approximation in multicriteria optimization
Cited in
(11)- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- A cutting-plane method to nonsmooth multiobjective optimization problems
- Multi-criteria optimization in regression
- Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions
- Nonsmooth multiobjective programming with quasi-Newton methods
- The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous
- An adaptive nonmonotone line search for multiobjective optimization problems
- Trust region methods for solving multiobjective optimisation
- Quasi-Newton methods for solving multiobjective optimization
- An incremental descent method for multi-objective optimization
- Decision space decomposition for multiobjective optimization
This page was built for publication: Multicriteria optimization with a multiobjective golden section line search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662303)
