Dynamic search trajectory methods for global optimization
DOI10.1007/S10472-019-09661-7zbMATH Open1461.65113OpenAlexW2970218523WikidataQ127280305 ScholiaQ127280305MaRDI QIDQ2294590FDOQ2294590
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) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Numerical methods for initial value problems involving ordinary differential equations (65L05)
Cites Work
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Practical methods of optimization.
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Title not available (Why is that?)
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Title not available (Why is that?)
- Global optimization by controlled random search
- Solving Ordinary Differential Equations I
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Nonmonotone Line Search Technique for Newton’s Method
- A collection of test problems for constrained global optimization algorithms
- Minimization of functions having Lipschitz continuous first partial derivatives
- Numerical recipes in C++. The art of scientific computing
- Numerical Methods for Ordinary Differential Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stochastic adaptive search for global optimization.
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
- Title not available (Why is that?)
- Introduction to global optimization.
- Trajectory-following algorithms for min-max optimization problems
- Generalized descent for global optimization
- Metaheuristics—the metaphor exposed
- Control Perspectives on Numerical Algorithms and Matrix Problems
- Some methods of speeding up the convergence of iteration methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ordinary differential equations. An introduction
- A reassessment of the Snyman-Fatti dynamic search trajectory method for unconstrained global optimization
- A multi-start global minimization algorithm with dynamic search trajectories
- A new and dynamic method for unconstrained minimization
- The dynamic-Q optimization method: an alternative to SQP?
- Global minimum cost design of a welded square stiffened plate supported at four corners
- Modified trajectory method for practical global optimization problems
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- Title not available (Why is that?)
- A trajectory-followed method for unconstrained optimization
- Stochastic Methods for Global Optimization
- A New Method for Solving Nonlinear Simultaneous Equations
- From linear to nonlinear iterative methods
- 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
- Evolutionary operators in global optimization with dynamic search trajectories
- An Algorithm, Based on Singular Perturbation Theory, for Ill-Conditioned Minimization Problems
- Quasi-Newton Methods for Unconstrained Optimization
- Optimal design of laminated composite plates with dynamic and static considerations
- Steepest descent with momentum for quadratic functions is a version of the conjugate gradient method
- Title not available (Why is that?)
- Title not available (Why is that?)
- A dynamic penalty function method for the solution of structural optimization problems
- Modern Optimization Techniques with Applications in Electric Power Systems
- Practical mathematical optimization. Basic optimization theory and gradient-based algorithms
- A note on open problems and challenges in optimization theory and algorithms
- No free lunch theorem: a review
- Title not available (Why is that?)
- Artificial Intelligence and Soft Computing - ICAISC 2004
Cited In (7)
- Global optimization using dynamic search trajectories
- Evolutionary operators in global optimization with dynamic search trajectories
- Title not available (Why is that?)
- Search-trajectory optimization. II: Algorithms and computations
- Title not available (Why is that?)
- Title not available (Why is that?)
- (Global) optimization: historical notes and recent developments
This page was built for publication: Dynamic search trajectory methods for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294590)
