Convex optimization techniques due to Nestrov and computational complexity

MaRDI QIDQ4898650zbMATH OpenFDO

Authors Paras Bhatnagar, Prashant Chauhan

Publication date 2 January 2013

zbMATH Keywords

robustnessNesterov's methodconvergence and property of solutionduality and bounds

Mathematics Subject Classification ID

Convex programming (90C25) Minimax problems in mathematical programming (90C47) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)

Recommendations

• Minimax estimation of large covariance matrices under \(\ell_1\)-norm
• A Compound Decision Approach to Covariance Matrix Estimation
• An overview of the estimation of large covariance and precision matrices
• Sparse estimation of high-dimensional correlation matrices
• Large-scale sparse inverse covariance matrix estimation

Cited in

(3)

• Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
• A hierarchical approach to covariance function estimation for time series
• The Evolution of Methods of Convex Optimization

This page was built for publication: Convex optimization techniques due to Nestrov and computational complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4898650)