A quasisecant method for minimizing nonsmooth functions
From MaRDI portal
Publication:3562378
DOI10.1080/10556780903151565zbMath1202.65072OpenAlexW2082460188MaRDI QIDQ3562378
Asef Nazari Ganjehlou, Adil M. Bagirov
Publication date: 21 May 2010
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780903151565
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items (18)
Comparing different nonsmooth minimization methods and software ⋮ A new trust region method for nonsmooth nonconvex optimization ⋮ Subgradient method for nonconvex nonsmooth optimization ⋮ A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes ⋮ Conjugate gradient type methods for the nondifferentiable convex minimization ⋮ A system of nonsmooth equations solver based upon subgradient method ⋮ A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization ⋮ Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ Aggregate subgradient method for nonsmooth DC optimization ⋮ A quasisecant method for solving a system of nonsmooth equations ⋮ An adaptive competitive penalty method for nonsmooth constrained optimization ⋮ Codifferential method for minimizing nonsmooth DC functions ⋮ A modified quasisecant method for global optimization ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra ⋮ Subgradient and Bundle Methods for Nonsmooth Optimization ⋮ Hyperbolic smoothing function method for minimax problems ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
Uses Software
This page was built for publication: A quasisecant method for minimizing nonsmooth functions
