Generalized descent for global optimization
From MaRDI portal
Publication:1138228
DOI10.1007/BF00933356zbMath0431.49036OpenAlexW2098964861WikidataQ57389759 ScholiaQ57389759MaRDI QIDQ1138228
Publication date: 1981
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00933356
Related Items
A multi-start global minimization algorithm with dynamic search trajectories, A new simple, fast and efficient algorithm for global optimization over continuous search-space problems: radial movement optimization, A novel hybrid bat algorithm with harmony search for global numerical optimization, Potential transformation methods for large-scale constrained global optimization, Chaotic league championship algorithms, Basin hopping networks of continuous global optimization problems, A search technique for global optimization in a chaotic environment, A subclass of generating set search with convergence to second-order stationary points, Chaos embedded particle swarm optimization algorithms, Central configurations and a theorem of Palmore, Parallel approximation of multidimensional tensors using GPUs, Stochastic global optimization methods part II: Multi level methods, An efficient implementation of parallel simulated annealing algorithm in GPUs, Hierarchical winner-take-all particle swarm optimization social network for neural model fitting, A harmonic framework for stepsize selection in gradient methods, Recent Theoretical Advances in Non-Convex Optimization, Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation, Global optimization using a synchronization of multiple search points autonomously driven by a chaotic dynamic model, Precision in High Dimensional Optimisation of Global Tasks with Unknown Solutions, MAKHA -- a new hybrid swarm intelligence global optimization algorithm, Fast chaotic optimization algorithm based on spatiotemporal maps for global optimization, An evaluation of the Sniffer global optimization algorithm using standard test functions, Free Search in Multidimensional Space III, Directed particle swarm optimization with Gaussian-process-based function forecasting, Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗, Optimizing partially separable functions without derivatives, The gradient evolution algorithm: a new metaheuristic, Parallel two-phase methods for global optimization on GPU, \( q\)-Gaussian swarm quantum particle intelligence on predicting global minimum of potential energy function, Basin hopping with synched multi L-BFGS local searches. Parallel implementation in multi-CPU and GPUs, The application of a unified Bayesian stopping criterion in competing parallel algorithms for global optimization, Global optimization using a dynamical systems approach, A hybrid genetic algorithm with the Baldwin effect, Interactive model-based search for global optimization, Diffusion equation method of global minimization: Performance for standard test functions, Mathematically rigorous global optimization in floating-point arithmetic, A generalized worst-case complexity analysis for non-monotone line searches, A derivation of the number of minima of the Griewank function, Dynamic search trajectory methods for global optimization, A deterministic algorithm for global optimization, Exploiting problem structure in pattern search methods for unconstrained optimization, Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization, Towards ``Ideal multistart. A stochastic approach for locating the minima of a continuous function inside a bounded domain, Comparative analysis of the cutting angle and simulated annealing methods in global optimization, Experiments with new stochastic global optimization search techniques, Parallel MCMC methods for global optimization, A sequential approach for unconstrained optimization via a partitioning technique, Optimal direct determination of sparse Jacobian matrices, A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
Cites Work
- Unnamed Item
- Unnamed Item
- Starlike domains of convergence for Newton's method at singularities
- A convergent process of price adjustment and global Newton methods
- Über die Vollständigkeit der Relationen von Morse für die Anzahlen kritischer Punkte
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
- Systematic Search in High Dimensional Sets
- A New Method for Solving Nonlinear Simultaneous Equations
- A New Algorithm for Unconstrained Optimization
- Sequential Optimization of Multimodal Discrete Function with Bounded Rate of Change
