Approximation methods for the unconstrained optimization
From MaRDI portal
Cites work
- `` Direct Search Solution of Numerical and Statistical Problems
- A comparison of gradient dependent techniques for the minimization of an unconstrained function of several variables
- A comparison of modified Newton methods for unconstrained optimisation
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
- A Correction Concerning the Convergence Rate for the Conjugate Gradient Method
- A Family of Gradient Methods for Optimization
- A fifth-order family of modified Newton methods
- A method of unconstrained global optimization
- A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
- A new approach to variable metric algorithms
- A Nongradient and Parallel Algorithm for Unconstrained Minimization
- A Quasi-Newton Method with No Derivatives
- A Rank Two Algorithm for Unconstrained Minimization
- A Rapidly Convergent Descent Method for Minimization
- A Review of Minimization Techniques for Nonlinear Functions
- A Simplex Method for Function Minimization
- A study of test functions for optimization algorithms
- A Survey of Numerical Methods for Unconstrained Optimization
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- An algorithm that minimizes homogeneous functions of \(n\) variables in \(n + 2\) iterations and rapidly minimizes general functions
- An effective algorithm for minimization
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- An Improved Procedure for Orthogonalising the Search Vectors in Rosenbrock's and Swann's Direct Search Optimisation Methods
- An Iterative Method for Finding Stationary Values of a Function of Several Variables
- An iterative method for locating turning points
- Application of the Monte Carlo method to systems of nonlinear algebraic equations
- Approximation Methods which Converge with Probability one
- Asymptotic Distribution of Stochastic Approximation Procedures
- Bemerkungen zum Gradientenverfahren
- Cauchy's method of minimization
- Comparison of Gradient Methods for the Solution of Nonlinear Parameter Estimation Problems
- Comparison of some conjugate direction procedures for function minimization
- Computational experience with quadratically convergent minimisation methods
- Contributions to the theory of the method of steepest descent
- Convergence Conditions for Ascent Methods
- Convergence of the conjugate gradient method with computationally convenient modifications
- Convergence rate of the gradient descent method with dilatation of the space
- Ein allgemeines Maximalisierungverfahren
- Extended Aitken acceleration
- Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation
- Extremwertermittlung mit Funktionswerten bei Funktionen von mehreren Veränderlichen. (Determination of the extremum value by means of function values for functions of seberal variables)
- Function minimization by conjugate gradients
- Function Minimization Without Evaluating Derivatives--a Review
- Global Convergence of Newton–Gauss–Seidel Methods
- Gradient methods of maximization
- scientific article; zbMATH DE number 3147900 (Why is no real title available?)
- scientific article; zbMATH DE number 3153481 (Why is no real title available?)
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3473159 (Why is no real title available?)
- scientific article; zbMATH DE number 3206518 (Why is no real title available?)
- scientific article; zbMATH DE number 3206654 (Why is no real title available?)
- scientific article; zbMATH DE number 3215488 (Why is no real title available?)
- scientific article; zbMATH DE number 3220839 (Why is no real title available?)
- scientific article; zbMATH DE number 3231485 (Why is no real title available?)
- scientific article; zbMATH DE number 3273622 (Why is no real title available?)
- scientific article; zbMATH DE number 3288365 (Why is no real title available?)
- scientific article; zbMATH DE number 3291576 (Why is no real title available?)
- scientific article; zbMATH DE number 3303575 (Why is no real title available?)
- scientific article; zbMATH DE number 3304573 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3321690 (Why is no real title available?)
- scientific article; zbMATH DE number 3327678 (Why is no real title available?)
- scientific article; zbMATH DE number 3327988 (Why is no real title available?)
- scientific article; zbMATH DE number 3328760 (Why is no real title available?)
- scientific article; zbMATH DE number 3331863 (Why is no real title available?)
- scientific article; zbMATH DE number 3354523 (Why is no real title available?)
- scientific article; zbMATH DE number 3359980 (Why is no real title available?)
- scientific article; zbMATH DE number 3364730 (Why is no real title available?)
- scientific article; zbMATH DE number 3370185 (Why is no real title available?)
- scientific article; zbMATH DE number 3373533 (Why is no real title available?)
- scientific article; zbMATH DE number 3395301 (Why is no real title available?)
- scientific article; zbMATH DE number 3400687 (Why is no real title available?)
- scientific article; zbMATH DE number 3067118 (Why is no real title available?)
- scientific article; zbMATH DE number 3092874 (Why is no real title available?)
- Inversion of Matrices by Biorthogonalization and Related Results
- Letter to the Editor—A Monte Carlo Method for the Approximate Solution of Certain Types of Constrained Optimization Problems
- Location of the Maximum on Unimodal Surfaces
- Memory gradient method for the minimization of functions
- Methods of conjugate gradients for solving linear systems
- Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
- Minimization by Successive Approximation
- Minimization of functions having Lipschitz continuous first partial derivatives
- Minimizing a function without calculating derivatives
- Minimizing Certain Convex Functions
- Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
- Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables
- N-step conjugate gradient minimization scheme for nonquadratic functions
- Newton's method for convex programming and Tschebyscheff approximation
- Numerical computational methods of optimisation in control
- Numerical experiments on quadratically convergent algorithms for function minimization
- On Descent from Local Minima
- On finding local maxima of functions of a real variable
- On the asymptotic directions of the s-dimensional optimum gradient method
- On the Relative Efficiencies of Gradient Methods
- On the use of generalized inverses in function minimization
- On variable-metric algorithms
- Optimization by Least Squares
- Optimization Problems: Solution by an Analogue Computer
- Parameter Selection for Modified Newton Methods for Function Minimization
- Point Estimates of Ordinates of Concave Functions
- Properties of the conjugate-gradient and Davidon methods
- Quasi-Newton Methods and their Application to Function Minimisation
- Quasi-Newton Methods for Unconstrained Optimization
- Rate of Convergence of Several Conjugate Gradient Algorithms
- Relation between the memory gradient method and the Fletcher-Reeves method
- Research on a constrained minimization problem of a function with first and second derivatives
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- Sequential Minimax Search for a Maximum
- Some Algorithms for Minimizing a Function of Several Variables
- Stochastic ascent
- Stochastic Estimation of the Maximum of a Regression Function
- Study on a supermemory gradient method for the minimization of functions
- Sur La Méthode De Davidon-Flechter-Powell Pour La Minimisation Des Fonctions
- The application of third variations to function minimization
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- The Convergence of a Class of Double-rank Minimization Algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- The Convergence of an Algorithm for Solving Sparse Nonlinear Systems
- The Convergence of Single-Rank Quasi-Newton Methods
- The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
- The Hydrodynamic Resistance of a Fluid Sphere Submerged in Stokes Flows
- The potential method for conditional maxima in the locally compact metric spaces
- The Slacked Unconstrained Minimization Technique for Convex Programming
- Two Algorithms Related to the Method of Steepest Descent
- Unified approach to quadratically convergent algorithms for function minimization
- Variable Metric Method for Minimization
- Variance algorithm for minimization
- Variational methods in problems of control and programming
- Über die Konvergenz von Einzelschrittverfahren zur Minimierung konvexer Funktionen. (On convergence of one-step methods for minimizing convex functions.)
- Über die Schrittweitenwahl bei Abstiegsverfahren zur Minimierung konvexer Funktionen
- Über Dämpfung bei Minimalisierungsverfahren. (On damping in minimization methods)
- Über einige Methoden der Relaxationsrechnung
This page was built for publication: Approximation methods for the unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1234630)