A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
From MaRDI portal
Publication:5654676
Recommendations
Cited in
(31)- Optimization of lipschitz continuous functions
- Conditional subgradient optimization -- theory and applications
- Descent methods for composite nondifferentiable optimization problems
- Using the ?-subgradient method to solve the dual and the primal mathematical programming problems
- scientific article; zbMATH DE number 67982 (Why is no real title available?)
- Two-direction subgradient method for non-differentiable optimization problems
- scientific article; zbMATH DE number 3641202 (Why is no real title available?)
- Subdifferentials of functions on sets
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- Auction algorithms for network flow problems: A tutorial introduction
- Numerical reduced variable optimization methods via implicit functional dependence with applications
- A subgradient descent algorithm for optimization of initially controllable flow shop systems
- A subgradient projection algorithm
- Monotone algorithm for seeking saddle point of unsmooth function
- An introduction to continuous optimization for imaging
- \(\epsilon\)-subgradient method for the solution of nonlinear extremal problems
- scientific article; zbMATH DE number 429229 (Why is no real title available?)
- scientific article; zbMATH DE number 3938461 (Why is no real title available?)
- Essentials of numerical nonsmooth optimization
- Implementation of a subgradient projection algorithm
- Continuous approximations to generalized jacobians
- Implementation of a subgradient projection algorithm II
- Epsilon subdifferential method and integrability
- Application of the subdifferential descent method to a classical nonsmooth variational problem
- An optimal method of constructing an \(\varepsilon\)-subgradient
- Theorems of the alternative and duality
- Essentials of numerical nonsmooth optimization
- scientific article; zbMATH DE number 4057291 (Why is no real title available?)
- Approximate optimality conditions and sensitivity analysis in nearly convex optimization
- An infeasible-point subgradient method using adaptive approximate projections
This page was built for publication: A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5654676)
