Application of interval slopes in nonsmooth one-dimensional optimization problems

DOI10.1134/S0965542524702129MaRDI QIDQ6986216zbMATH OpenFDO

Authors M. A. Posypkin, D. A. Sidnev

Publication date 12 May 2025

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0965542524702129

zbMATH Keywords

global optimizationinterval analysismonotonicity criteriainterval slopedeterministic optimization methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Cites work

• scientific article; zbMATH DE number 4015993 (Why is no real title available?)
• scientific article; zbMATH DE number 5775425 (Why is no real title available?)
• scientific article; zbMATH DE number 4041131 (Why is no real title available?)
• scientific article; zbMATH DE number 4049910 (Why is no real title available?)
• scientific article; zbMATH DE number 193463 (Why is no real title available?)
• scientific article; zbMATH DE number 2035082 (Why is no real title available?)
• A branch and prune algorithm for the computation of generalized aspects of parallel robots
• A nonsmooth global optimization technique using slopes: The one-dimensional case
• Adaptive nested optimization scheme for multidimensional global search
• Algorithm AS 133: Optimization of One-Dimensional Multimodal Functions
• An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions
• Computation of rational interval functions
• Connecting optimization with spectral analysis of tri-diagonal matrices
• Convex Analysis
• Efficient interaction-aware interval analysis of neural network feedback loops
• Extended univariate algorithms for n-dimensional global optimization
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Global optimization. From theory to implementation.
• Interval Methods for Systems of Equations
• Introduction to Interval Analysis
• Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization
• Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
• Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives
• Numerical methods for finding global extrema (Case of a non-uniform mesh)
• Numerical methods using two different approximations of space-filling curves for black-box global optimization
• Piecewise linear bounding functions in univariate global optimization
• Safe global optimization of expensive noisy black-box functions in the -Lipschitz framework

This page was built for publication: Application of interval slopes in nonsmooth one-dimensional optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986216)