Pages that link to "Item:Q2174899"
From MaRDI portal
The following pages link to A concave optimization-based approach for sparse multiobjective programming (Q2174899):
Displaying 7 items.
- Concave programming for minimizing the zero-norm over polyhedral sets (Q989849) (← links)
- MOEA/D with chain-based random local search for sparse optimization (Q1626237) (← links)
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems (Q2693645) (← links)
- A greedy Newton-type method for multiple sparse constraint problem (Q2696970) (← links)
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems (Q5058409) (← links)
- Sparse convex optimization toolkit: a mixed-integer framework (Q6087059) (← links)
- Inexact penalty decomposition methods for optimization problems with geometric constraints (Q6133301) (← links)