Dynamic search trajectory methods for global optimization
From MaRDI portal
Publication:2294590
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 994717 (Why is no real title available?)
- scientific article; zbMATH DE number 46305 (Why is no real title available?)
- scientific article; zbMATH DE number 52120 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 3637199 (Why is no real title available?)
- scientific article; zbMATH DE number 976350 (Why is no real title available?)
- scientific article; zbMATH DE number 1795720 (Why is no real title available?)
- scientific article; zbMATH DE number 3999169 (Why is no real title available?)
- scientific article; zbMATH DE number 757674 (Why is no real title available?)
- scientific article; zbMATH DE number 778144 (Why is no real title available?)
- scientific article; zbMATH DE number 852532 (Why is no real title available?)
- scientific article; zbMATH DE number 3382096 (Why is no real title available?)
- scientific article; zbMATH DE number 3384519 (Why is no real title available?)
- scientific article; zbMATH DE number 3182507 (Why is no real title available?)
- A New Method for Solving Nonlinear Simultaneous Equations
- A Nonmonotone Line Search Technique for Newton’s Method
- A collection of test problems for constrained global optimization algorithms
- A dynamic penalty function method for the solution of structural optimization problems
- A multi-start global minimization algorithm with dynamic search trajectories
- A new and dynamic method for unconstrained minimization
- A note on open problems and challenges in optimization theory and algorithms
- A reassessment of the Snyman-Fatti dynamic search trajectory method for unconstrained global optimization
- A trajectory-followed method for unconstrained optimization
- An Algorithm, Based on Singular Perturbation Theory, for Ill-Conditioned Minimization Problems
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Control Perspectives on Numerical Algorithms and Matrix Problems
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Evolutionary operators in global optimization with dynamic search trajectories
- From linear to nonlinear iterative methods
- Generalized descent for global optimization
- Global minimum cost design of a welded square stiffened plate supported at four corners
- Global optimization by controlled random search
- Introduction to global optimization.
- Metaheuristics -- the metaphor exposed
- Minimization of functions having Lipschitz continuous first partial derivatives
- Modern optimization techniques with applications in electric power systems.
- Modified trajectory method for practical global optimization problems
- No free lunch theorem: a review
- Numerical Methods for Ordinary Differential Equations
- Numerical recipes in C++. The art of scientific computing
- 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 20
- Optimal design of laminated composite plates with dynamic and static considerations
- Ordinary differential equations. An introduction
- Practical mathematical optimization. Basic optimization theory and gradient-based algorithms
- Practical methods of optimization.
- Quasi-Newton Methods for Unconstrained Optimization
- Solving Ordinary Differential Equations I
- Some methods of speeding up the convergence of iteration methods
- Steepest descent with momentum for quadratic functions is a version of the conjugate gradient method
- Stochastic Methods for Global Optimization
- Stochastic adaptive search for global optimization.
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The dynamic-Q optimization method: an alternative to SQP?
- Trajectory-following algorithms for min-max optimization problems
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
Cited in
(9)- A survey of methods available for the numerical optimization of continuous dynamic systems
- Global optimization using dynamic search trajectories
- Evolutionary operators in global optimization with dynamic search trajectories
- Search-trajectory optimization. II: Algorithms and computations
- scientific article; zbMATH DE number 1795720 (Why is no real title available?)
- scientific article; zbMATH DE number 2094782 (Why is no real title available?)
- scientific article; zbMATH DE number 994717 (Why is no real title available?)
- A novel three-phase trajectory informed search methodology for global optimization
- (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)
