Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
From MaRDI portal
Publication:1790671
DOI10.1007/s10589-017-9957-yzbMath1465.90123OpenAlexW2766556641MaRDI QIDQ1790671
Yaroslav D. Sergeyev, Renato De Leone, Giovanni Fasano
Publication date: 2 October 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10278/3694946
Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Methods of reduced gradient type (90C52) Other applications of nonstandard models (economics, physics, etc.) (03H10)
Related Items
Some paradoxes of infinity revisited ⋮ Novel first and second order numerical differentiation techniques and their application to nonlinear analysis of Kirchhoff-Love shells ⋮ Infinite games on finite graphs using grossone ⋮ The use of grossone in elastic net regularization and sparse support vector machines ⋮ Spherical separation with infinitely far center ⋮ 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 ⋮ Grossone Methodology for Lexicographic Mixed-Integer Linear Programming Problems ⋮ Infinite Games on Finite Graphs Using Grossone ⋮ A Simulink-Based Infinity Computer Simulator and Some Applications ⋮ Noise-induced kinetic transition in two-component environment ⋮ Polarity and conjugacy for quadratic hypersurfaces: a unified framework with recent advances ⋮ A Simulink-based software solution using the infinity computer methodology for higher order differentiation ⋮ Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation ⋮ Introduction to the special issue for SIMAI 2016
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metamathematical investigations on the theory of grossone
- A classification of one-dimensional cellular automata using infinite computations
- Infinitesimals and infinites in the history of mathematics: a brief survey
- The use of grossone in mathematical programming and operations research
- Cellular automata using infinite computations
- Interpretation of percolation in terms of infinity computations
- On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
- Usage of infinitesimals in the Menger's sponge model of porosity
- Solving ordinary differential equations on the Infinity Computer by working with infinitesimals numerically
- Higher order numerical differentiation on the infinity computer
- Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems
- Planar quasi-Newton algorithms for unconstrained saddlepoint problems
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Conjugate direction methods and polarity for quadratic hypersurfaces
- Using grossone to count the number of elements of infinite sets and the connection with bijections
- The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area
- A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic
- Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems
- Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
- Unified approach to quadratically convergent algorithms for function minimization
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- Computations with Grossone-Based Infinities
- Methodology of Numerical Computations with Infinities and Infinitesimals
- A new applied approach for executing computations with infinite and infinitesimal quantities
- Trust Region Methods
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks
- A Nonmonotone Line Search Technique for Newton’s Method
- The Limited Memory Conjugate Gradient Method
- Hyperbolic Pairs in the Method of Conjugate Gradients
- Methods of conjugate gradients for solving linear systems
