On necessary optimality conditions for sets of points in multiobjective optimization
From MaRDI portal
Publication:6636780
DOI10.1007/S10957-024-02478-3MaRDI QIDQ6636780FDOQ6636780
Authors: Andrea Cristofari, M. De Santis, Stefano Lucidi 
Publication date: 12 November 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 2143163
- Necessary optimality conditions in generalized convex multi-objective optimization involving nonconvex constraints
- Derived sets in multiobjective optimization
- Optimality conditions for approximate solutions in multiobjective optimization problems
- Explicit gradient information in multiobjective optimization
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30)
Cites Work
- A derivative-free approach to constrained multiobjective nonsmooth optimization
- Nonlinear multiobjective optimization
- Nonlinear Programming
- Approximation methods in multiobjective programming
- Direct Multisearch for Multiobjective Optimization
- Steepest descent methods for multicriteria optimization.
- An external penalty-type method for multicriteria
- Newton's method for multiobjective optimization
- Regularity conditions in differentiable vector optimization revisited
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Constrained minimization under vector-valued criteria in finite dimensional spaces
- A barrier-type method for multiobjective optimization
- Improved front steepest descent for multi-objective optimization
- Pareto front approximation through a multi-objective augmented Lagrangian method
- On the convergence of steepest descent methods for multiobjective optimization
- An augmented Lagrangian algorithm for multi-objective optimization
- A Note on Motzkin's Transposition Theorem
- A general branch-and-bound framework for continuous global multiobjective optimization
- Globally convergent Newton-type methods for multiobjective optimization
- A limited memory quasi-Newton approach for multi-objective optimization
- Generalized polarity and weakest constraint qualifications in multiobjective optimization
- Limit sets in global multiobjective optimization
- A solver for multiobjective mixed-integer convex and nonconvex optimization
This page was built for publication: On necessary optimality conditions for sets of points in multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636780)
