An efficient descent direction method with cutting planes
From MaRDI portal
Recommendations
- A cutting method with updating approximating sets and its combination with other algorithms
- A cutting method and construction of mixed minimization algorithms on its basis
- Two descent hybrid conjugate gradient methods for optimization
- scientific article; zbMATH DE number 3948004
- A class of efficient new descent methods
Cites work
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Autoregressive Conditional Heteroscedasticity with Estimates of the Variance of United Kingdom Inflation
- Complexity analysis of the analytic center cutting plane method that uses multiple cuts
- Convergence of line search methods for unconstrained optimization
- GARCH processes: structure and estimation
- Generalized autoregressive conditional heteroscedasticity
- Minimization of functions having Lipschitz continuous first partial derivatives
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
- Quasi-maximum likelihood estimation and inference in dynamic models with time-varying covariances
- Recursive Estimation of GARCH Models
- Steplength algorithms for minimizing a class of nondifferentiable functions
- Testing Unconstrained Optimization Software
This page was built for publication: An efficient descent direction method with cutting planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623787)