A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
From MaRDI portal
Publication:5058409
Recommendations
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- A concave optimization-based approach for sparse multiobjective programming
- Vectorial penalization in multi-objective optimization
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems
- Optimality conditions and numerical methods for a continuous reformulation of cardinality constrained optimization problems
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Scalable Algorithm for Sparse Portfolio Selection
- A concave optimization-based approach for sparse multiobjective programming
- A method for constrained multiobjective optimization based on SQP techniques
- A projected gradient method for vector optimization problems
- ASMO
- Algorithm for cardinality-constrained quadratic optimization
- An Adaptive Scalarization Method in Multiobjective Optimization
- An augmented Lagrangian algorithm for multi-objective optimization
- An effective procedure for feature subset selection in logistic regression based on information criteria
- Best subset selection via a modern optimization lens
- Compressed sensing
- Computational study of a family of mixed-integer quadratic programming problems
- Direct Multisearch for Multiobjective Optimization
- Dominating sets for convex functions with some applications
- Efficient cardinality/mean-variance portfolios
- Inexact projected gradient method for vector optimization
- Logistic regression: from art to science
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Multiobjective portfolio optimization: bridging mathematical theory with asset management practice
- Newton's method for multiobjective optimization
- OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
- On the choice of parameters for the weighting method in vector optimization
- On the convergence of steepest descent methods for multiobjective optimization
- On the convergence of the projected gradient method for vector optimization
- Optimization with sparsity-inducing penalties
- Pareto front approximation through a multi-objective augmented Lagrangian method
- Robust multiobjective portfolio optimization: a set order relations approach
- Scalarizing vector optimization problems
- Sparse Approximate Solutions to Linear Systems
- Sparse Approximation via Penalty Decomposition Methods
- Sparse inverse covariance estimation with the graphical lasso
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Steepest descent methods for multicriteria optimization.
- The general mean-variance portfolio selection problem
Cited in
(4)- Inexact penalty decomposition methods for optimization problems with geometric constraints
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- A concave optimization-based approach for sparse multiobjective programming
- Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms
This page was built for publication: A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058409)
