Pages that link to "Item:Q2249821"
From MaRDI portal
The following pages link to Multiobjective DC programs with infinite convex constraints (Q2249821):
Displaying 5 items.
- Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions (Q289089) (← links)
- Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management (Q481062) (← links)
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← links)
- Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels (Q1784885) (← links)
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems (Q2053032) (← links)
