Pages that link to "Item:Q5654676"
From MaRDI portal
The following pages link to A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals (Q5654676):
Displaying 20 items.
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
- \(\epsilon\)-subgradient method for the solution of nonlinear extremal problems (Q1115807) (← links)
- A subgradient projection algorithm (Q1164968) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- Conditional subgradient optimization -- theory and applications (Q1266608) (← links)
- Theorems of the alternative and duality (Q1369042) (← links)
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
- Monotone algorithm for seeking saddle point of unsmooth function (Q3340509) (← links)
- Implementation of a subgradient projection algorithm (Q3660798) (← links)
- Implementation of a subgradient projection algorithm II (Q3688108) (← links)
- Using the ?-subgradient method to solve the dual and the primal mathematical programming problems (Q3771978) (← links)
- Optimization of lipschitz continuous functions (Q4177351) (← links)
- (Q4199843) (← links)
- Subdifferentials of functions on sets (Q4745625) (← links)
- Continuous approximations to generalized jacobians (Q4944357) (← links)
- (Q5074521) (← links)
- An introduction to continuous optimization for imaging (Q5740077) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
