A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization)
DOI10.2478/S11533-008-0039-3zbMATH Open1155.65050OpenAlexW2141081541MaRDI QIDQ944053FDOQ944053
Authors: Marek J. Śmietański 
Publication date: 12 September 2008
Published in: Central European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/s11533-008-0039-3
Recommendations
- On superlinear convergence in univariate nonsmooth minimization
- A Newton-type univariate optimization algorithm for locating the nearest extremum
- scientific article; zbMATH DE number 2075763
- scientific article; zbMATH DE number 749354
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
numerical examplesalgorithmunconstrained optimizationsuperlinear convergenceNewton-type methodsemismooth functionlinear bounding functionUnivariate optimization
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Cites Work
- A nonsmooth version of Newton's method
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- Semismooth and Semiconvex Functions in Constrained Optimization
- Trust Region Methods
- Newton's Method for B-Differentiable Equations
- On concepts of directional differentiability
- Secant methods for semismooth equations
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- A class of exponential quadratically convergent iterative formulae for unconstrained optimization
- Superlinear convergence of smoothing quasi-Newton methods for nonsmooth equations
- A Newton-type univariate optimization algorithm for locating the nearest extremum
- Test problems for Lipschitz univariate global optimization with multiextremal constraints
Cited In (1)
This page was built for publication: A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q944053)
