Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
From MaRDI portal
Publication:2422878
DOI10.1016/J.AMC.2017.07.057zbMath1426.90197OpenAlexW2743286152MaRDI QIDQ2422878
Marat S. Mukhametzhanov, Manlio Gaudioso, Giovanni Giallombardo
Publication date: 21 June 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.07.057
Related Items (23)
Simulation of hybrid systems under Zeno behavior using numerical infinitesimals ⋮ Some paradoxes of infinity revisited ⋮ Novel first and second order numerical differentiation techniques and their application to nonlinear analysis of Kirchhoff-Love shells ⋮ On the use of the infinity computer architecture to set up a dynamic precision floating-point arithmetic ⋮ The use of grossone in elastic net regularization and sparse support vector machines ⋮ Spherical separation with infinitely far center ⋮ Foreword to the special issue ``Recent trends in numerical computations: theory and algorithms ⋮ Iterative grossone-based computation of negative curvature directions in large-scale optimization ⋮ A new cutting plane method for lexicographic multi-objective integer linear programming ⋮ Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives ⋮ Computation of higher order Lie derivatives on the infinity computer ⋮ Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology ⋮ On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales ⋮ A Dynamic Precision Floating-Point Arithmetic Based on the Infinity Computer Framework ⋮ Grossone Methodology for Lexicographic Mixed-Integer Linear Programming Problems ⋮ A Simulink-Based Infinity Computer Simulator and Some Applications ⋮ Noise-induced kinetic transition in two-component environment ⋮ Conjugate-symplecticity properties of Euler-Maclaurin methods and their implementation on the infinity computer ⋮ Non-Archimedean game theory: a numerical approach ⋮ A Simulink-based software solution using the infinity computer methodology for higher order differentiation ⋮ Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite ⋮ Essentials of numerical nonsmooth optimization ⋮ Essentials of numerical nonsmooth optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Metamathematical investigations on the theory of grossone
- Numerical point of view on calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains
- The use of grossone in mathematical programming and operations research
- Computing sums of conditionally convergent and divergent series using the concept of grossone
- Cellular automata using infinite computations
- On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
- Diagonal bundle method for nonsmooth sparse optimization
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- A bundle modification strategy for convex minimization
- Fibonacci words, hyperbolic tilings and grossone
- A partially inexact bundle method for convex semi-infinite minmax problems
- Proximity control in bundle methods for convex nondifferentiable minimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Numerical computations and mathematical modelling with infinite and infinitesimal numbers
- Newton's method for convex programming and Tschebyscheff approximation
- A bundle-Newton method for nonsmooth unconstrained minimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- Variable metric bundle methods: From conceptual to implementable forms
- A method for convex minimization based on translated first-order approximations
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Methods of descent for nondifferentiable optimization
- Tuning strategy for the proximity parameter in convex minimization
- Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems
- Introduction to Nonsmooth Optimization
- The Cutting-Plane Method for Solving Convex Programs
- Quasi-Newton Methods, Motivation and Theory
This page was built for publication: Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
