A quasisecant method for minimizing nonsmooth functions
From MaRDI portal
Recommendations
- Subgradient method for nonconvex nonsmooth optimization
- scientific article; zbMATH DE number 16310
- A generalized subgradient method with piecewise linear subproblem
- A Method for Minimization of Quasidifferentiable Functions
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
Cited in
(28)- Conjugate gradient type methods for the nondifferentiable convex minimization
- Aggregate subgradient method for nonsmooth DC optimization
- A modified quasisecant method for global optimization
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization
- Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- Subgradient and bundle methods for nonsmooth optimization
- Hyperbolic smoothing function method for minimax problems
- Comparing different nonsmooth minimization methods and software
- A generalized subgradient method with piecewise linear subproblem
- A new trust region method for nonsmooth nonconvex optimization
- Second-order minimization method for nonsmooth functions allowing convex quadratic approximations of the augment
- Subgradient method for nonconvex nonsmooth optimization
- Nonsmooth optimization via quasi-Newton methods
- scientific article; zbMATH DE number 16310 (Why is no real title available?)
- scientific article; zbMATH DE number 4128317 (Why is no real title available?)
- Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
- scientific article; zbMATH DE number 1421092 (Why is no real title available?)
- Diagonal bundle method for nonsmooth sparse optimization
- Minimizing Piecewise-Concave Functions Over Polyhedra
- 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
- An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
- A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
- A system of nonsmooth equations solver based upon subgradient method
This page was built for publication: A quasisecant method for minimizing nonsmooth functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562378)
