A new arc algorithm for unconstrained optimization
From MaRDI portal
Publication:4174543
DOI10.1007/BF01608998zbMath0392.90076MaRDI QIDQ4174543
Publication date: 1978
Published in: Mathematical Programming (Search for Journal in Brave)
ConvergenceApproximationSearchComputational EfficiencySystem of Differential EquationsUnconstrained OptimizationArc AlgorithmGradient PathQuasinewton Type Algorithm
Related Items (9)
A switching regression method using inequality conditions ⋮ Local convergence of the steepest descent method in Hilbert spaces ⋮ A trajectory-based method for constrained nonlinear optimization problems ⋮ A restricted trust region algorithm for unconstrained optimization ⋮ Differential optimization techniques ⋮ A smoothing-out technique for min—max optimization ⋮ The application of optimal control methodology to nonlinear programming problems ⋮ A new super-memory gradient method with curve search rule ⋮ On the convergence of curvilinear search algorithms in unconstrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A variable metric-method for function minimization derived from invariancy to nonlinear scaling
- A Newton-type curvilinear search method for optimization
- A robust conjugate-gradient algorithm which minimizes L-functions
- A curvilinear optimization method based upon iterative estimation of the eigensystem of the Hessian matrix
- An Iterative Method for Finding Stationary Values of a Function of Several Variables
- On the Modification of LDL T Factorizations
- Self-Scaling Variable Metric (SSVM) Algorithms
- Optimally conditioned optimization algorithms without line searches
- An Arc Method for Nonlinear Programming
- Quasi-Newton Methods, Motivation and Theory
- Matrix conditioning and nonlinear optimization
- Unconstrained Optimization by Approximation of the Gradient Path
- Quadratic termination properties of Davidon's new variable metric algorithm
- A Homotopy based approach to unconstrained optimization
- A modified secant method for unconstrained minimization
- A Rapidly Convergent Descent Method for Minimization
- Quasi-Newton Methods and their Application to Function Minimisation
- A Family of Variable-Metric Methods Derived by Variational Means
- The Convergence of a Class of Double-rank Minimization Algorithms
- A new approach to variable metric algorithms
- Conditioning of Quasi-Newton Methods for Function Minimization
- Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
- Quasi-Newton Methods for Unconstrained Optimization
This page was built for publication: A new arc algorithm for unconstrained optimization
