An efficient descent direction method with cutting planes

DOI10.1007/s10100-009-0085-3zbMath1204.90105OpenAlexW2078916364MaRDI QIDQ623787

Balázs Torma, Boglárka G.-Tóth

Publication date: 8 February 2011

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-009-0085-3

zbMATH Keywords

parameter estimationcutting planedescent method

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Related Items (1)

An optimization technique for verified location of trajectories with prescribed geometrical behaviour in the chaotic forced damped pendulum

Uses Software

• KELLEY
• minpack
• Optimization Toolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steplength algorithms for minimizing a class of nondifferentiable functions
• Complexity analysis of the analytic center cutting plane method that uses multiple cuts
• GARCH processes: structure and estimation
• Generalized autoregressive conditional heteroscedasticity
• Convergence of line search methods for unconstrained optimization
• Nonmonotone projected gradient methods based on barrier and Euclidean distances
• Minimization of functions having Lipschitz continuous first partial derivatives
• Recursive Estimation of GARCH Models
• Testing Unconstrained Optimization Software
• Autoregressive Conditional Heteroscedasticity with Estimates of the Variance of United Kingdom Inflation
• Quasi-maximum likelihood estimation and inference in dynamic models with time-varying covariances
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization

This page was built for publication: An efficient descent direction method with cutting planes