The gradient subspace approximation and its application to bi-objective optimization problems

DOI10.1007/978-3-030-51264-4_15MaRDI QIDQ5131688zbMATH OpenOpenAlexFDO

Authors Oliver Schütze, Lourdes Uribe, Adriana Lara

Publication date 9 November 2020

Published in Advances in Dynamics, Optimization and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-51264-4_15

zbMATH Keywords

bi-objective optimizationdescent directionsgradient free optimizationgradient subspace approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Gradient subspace approximation: a direct search method for memetic computing
• On gradient-based local search to hybridize multi-objective evolutionary algorithms
• Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems
• Using a Gradient Based Method to Seed an EMO Algorithm
• GGA: a modified genetic algorithm with gradient-based local search for solving constrained optimization problems

Cites work

• Cell Mapping Methods
• Covering Pareto sets by multilevel subdivision techniques
• Evaluating Derivatives
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Gradient subspace approximation: a direct search method for memetic computing
• scientific article; zbMATH DE number 2013532 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Multi-objective optimization using evolutionary algorithms
• Multiobjective search algorithm with subdivision technique
• Newton's method for multiobjective optimization
• Nonlinear multiobjective optimization. A generalized homotopy approach
• On the hierarchical structure of Pareto critical sets
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• Steepest descent methods for multicriteria optimization.
• Stochastic method for the solution of unconstrained vector optimization problems
• The directed search method for multi-objective memetic algorithms
• Trade-off analysis approach for interactive nonlinear multiobjective optimization

Cited in

(4)

• A gradient based algorithm to solve inverse plane bimodular problems of identification
• Gradient subspace approximation: a direct search method for memetic computing
• Bi-objective optimisation over a set of convex sub-problems
• On gradient-based local search to hybridize multi-objective evolutionary algorithms

Describes a project that uses

Uses Software

• SMS-EMOA

This page was built for publication: The gradient subspace approximation and its application to bi-objective optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131688)