Dynamic search trajectory methods for global optimization
Publication:2294590
DOI10.1007/s10472-019-09661-7zbMath1461.65113OpenAlexW2970218523WikidataQ127280305 ScholiaQ127280305MaRDI QIDQ2294590
Panos M. Pardalos, Stamatios-Aggelos N. Alexandropoulos, Michael N. Vrahatis
Publication date: 11 February 2020
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-019-09661-7
global optimizationtrajectory methodsdynamic search trajectoriesautonomous initial value problemsglobally convergent algorithmsneural networks trainingnonmonotone convergent strategies
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Learning and adaptive systems in artificial intelligence (68T05) Numerical methods for initial value problems involving ordinary differential equations (65L05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global minimum cost design of a welded square stiffened plate supported at four corners
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- A reassessment of the Snyman-Fatti dynamic search trajectory method for unconstrained global optimization
- A multi-start global minimization algorithm with dynamic search trajectories
- Generalized descent for global optimization
- Global optimization by controlled random search
- A new and dynamic method for unconstrained minimization
- A collection of test problems for constrained global optimization algorithms
- A trajectory-followed method for unconstrained optimization
- Trajectory-following algorithms for min-max optimization problems
- A dynamic penalty function method for the solution of structural optimization problems
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Stochastic adaptive search for global optimization.
- The dynamic-Q optimization method: an alternative to SQP?
- Evolutionary operators in global optimization with dynamic search trajectories
- Ordinary differential equations. An introduction
- Open problems in optimization and data analysis. Based on the summer school on challenges and open problems in optimization and data science, Deucalion Summer Institute for Advanced Studies in Optimization, Mathematics, and Data Science, Greece, August 2016
- Practical mathematical optimization. Basic optimization theory and gradient-based algorithms
- From linear to nonlinear iterative methods
- Steepest descent with momentum for quadratic functions is a version of the conjugate gradient method
- A note on open problems and challenges in optimization theory and algorithms
- No free lunch theorem: a review
- Minimization of functions having Lipschitz continuous first partial derivatives
- Modern Optimization Techniques with Applications in Electric Power Systems
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Solving Ordinary Differential Equations I
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
- Stochastic Methods for Global Optimization
- Optimal design of laminated composite plates with dynamic and static considerations
- An Algorithm, Based on Singular Perturbation Theory, for Ill-Conditioned Minimization Problems
- A New Method for Solving Nonlinear Simultaneous Equations
- Modified trajectory method for practical global optimization problems
- Artificial Intelligence and Soft Computing - ICAISC 2004
- A Nonmonotone Line Search Technique for Newton’s Method
- Metaheuristics—the metaphor exposed
- Control Perspectives on Numerical Algorithms and Matrix Problems
- Some methods of speeding up the convergence of iteration methods
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Quasi-Newton Methods for Unconstrained Optimization
- Numerical Methods for Ordinary Differential Equations
- Introduction to global optimization.
