An approach to solving convex programs with nonsmooth objectives
From MaRDI portal
Recommendations
Cited in
(14)- A new method for nonsmooth convex optimization
- A unified monotonic approach to generalized linear fractional programming
- Convex programming for disjunctive convex optimization
- A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
- Modified objective function method in nonsmooth vector optimization over cones
- scientific article; zbMATH DE number 4176848 (Why is no real title available?)
- scientific article; zbMATH DE number 5151078 (Why is no real title available?)
- scientific article; zbMATH DE number 3902417 (Why is no real title available?)
- Solving nonsmooth inclusions in the convex case
- scientific article; zbMATH DE number 192898 (Why is no real title available?)
- scientific article; zbMATH DE number 1329056 (Why is no real title available?)
- scientific article; zbMATH DE number 2050765 (Why is no real title available?)
- scientific article; zbMATH DE number 3894848 (Why is no real title available?)
- On the convexification of nonlinear programming problems: An applications-oriented survey
This page was built for publication: An approach to solving convex programs with nonsmooth objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2731571)