A derivative-free method for linearly constrained nonsmooth optimization
From MaRDI portal
Publication:2458362
DOI10.3934/jimo.2006.2.319zbMath1122.90097OpenAlexW2331624527MaRDI QIDQ2458362
Moumita Ghosh, Dean Webb, Adil M. Bagirov
Publication date: 31 October 2007
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2006.2.319
Convex programming (90C25) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (9)
A trust region method for solving linearly constrained locally Lipschitz optimization problems ⋮ Incremental gradient-free method for nonsmooth distributed optimization ⋮ Using constraints at the conceptual stage of the design of carton erection ⋮ A quasisecant method for solving a system of nonsmooth equations ⋮ An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization ⋮ An algorithm for the estimation of a regression function by continuous piecewise linear functions ⋮ Clustering based polyhedral conic functions algorithm in classification ⋮ Statistical inferences for termination of Markov type random search algorithms ⋮ Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
Uses Software
This page was built for publication: A derivative-free method for linearly constrained nonsmooth optimization
