A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization

DOI10.1137/15M1037810zbMath1358.90133OpenAlexW2560729906MaRDI QIDQ3179268

Francesco Rinaldi, Stefano Lucidi, Giampaolo Liuzzi

Publication date: 21 December 2016

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/15m1037810

zbMATH Keywords

Lipschitz optimizationinequality constraintsexact penalty functionsderivative-free multiobjective optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52)

Related Items

A class of derivative-free trust-region methods with interior backtracking technique for nonlinear optimization problems subject to linear inequality constraints, Using first-order information in direct multisearch for multiobjective optimization, An adaptive direct multisearch method for black-box multi-objective optimization, A concave optimization-based approach for sparse multiobjective programming, Improved front steepest descent for multi-objective optimization, Pareto front approximation through a multi-objective augmented Lagrangian method, A memetic procedure for global multi-objective optimization, A trust-region approach for computing Pareto fronts in multiobjective optimization, Parallel strategies for direct multisearch, An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints, MultiGLODS: global and local multiobjective optimization using direct search, On the use of polynomial models in multiobjective directional direct search, Worst-case complexity bounds of directional direct-search methods for multiobjective optimization, Conditional gradient method for multiobjective optimization, Performance indicators in multiobjective optimization, A multi-objective \textbf{DIRECT} algorithm for ship hull optimization, DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization, Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint, DFMO, Derivative-free optimization methods, On the convergence of steepest descent methods for multiobjective optimization, An augmented Lagrangian algorithm for multi-objective optimization, Combined gradient methods for multiobjective optimization

Uses Software

• ACRS
• DFL
• DFN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An external penalty-type method for multicriteria
• Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
• A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
• A multiplier method with automatic limitation of penalty growth
• Direct Multisearch for Multiobjective Optimization
• Necessary and sufficient conditions for the efficient solutions of nondifferentiable multiobjective problems
• Multiobjective Optimization Through a Series of Single-Objective Formulations
• Introduction to Derivative-Free Optimization
• Optimization and nonsmooth analysis
• New Results on a Continuously Differentiable Exact Penalty Function
• On optimality conditions in nondifferentiable programming
• Nonlinear Lagrangian for Multiobjective Optimization and Applications to Duality and Exact Penalization
• Benchmarking optimization software with performance profiles.