Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms
From MaRDI portal
Publication:6493974
DOI10.1007/S10957-024-02397-3MaRDI QIDQ6493974
Pierluigi Mansueto, Matteo Lapucci
Publication date: 29 April 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Best subset selection via a modern optimization lens
- Differential evolution methods based on local searches
- On the convergence of steepest descent methods for multiobjective optimization
- An augmented Lagrangian algorithm for multi-objective optimization
- Dominating sets for convex functions with some applications
- Steepest descent methods for multicriteria optimization.
- A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making.
- An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints
- Logistic regression: from art to science
- A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
- Computational study of a family of mixed-integer quadratic programming problems
- Scalarizing vector optimization problems
- A projected gradient method for vector optimization problems
- An effective procedure for feature subset selection in logistic regression based on information criteria
- Proximal gradient methods for multiobjective optimization and their applications
- On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- Direct Multisearch for Multiobjective Optimization
- A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization
- Newton's Method for Multiobjective Optimization
- An Adaptive Scalarization Method in Multiobjective Optimization
- Sparse Approximate Solutions to Linear Systems
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
- Proximal Methods in Vector Optimization
- Sparse Approximation via Penalty Decomposition Methods
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
- Benchmarking optimization software with performance profiles.
- A unifying framework for sparsity-constrained optimization
- Pareto front approximation through a multi-objective augmented Lagrangian method
- Inexact penalty decomposition methods for optimization problems with geometric constraints
This page was built for publication: Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms