<--- Back to Details
First PageDocument Content
Real algebraic geometry / Matrix / Quadratic form / Rank / Polynomial / Least squares / Regression analysis / Sum-of-squares optimization / Linear least squares / Algebra / Mathematics / Linear algebra
Date: 2006-02-09 13:49:24
Real algebraic geometry
Matrix
Quadratic form
Rank
Polynomial
Least squares
Regression analysis
Sum-of-squares optimization
Linear least squares
Algebra
Mathematics
Linear algebra

Add to Reading List

Source URL: www.mathcs.emory.edu

Download Document from Source Website

File Size: 162,01 KB

Share Document on Facebook

Similar Documents

Least Squares Stephen Boyd EE103 Stanford University  November 4, 2015

Least Squares Stephen Boyd EE103 Stanford University November 4, 2015

DocID: 1puWN - View Document

Regularization / Science / Least squares / Analysis / Scientific method / Nuclear magnetic resonance / Mathematical optimization

ANAHESS, A NEW SECOND ORDER SUM OF EXPONENTIALS FIT ALGORITHM, COMPARED TO THE TIKHONOV REGULARIZATION APPROACH, WITH NMR APPLICATIONS Åsmund Ukkelberg 1,*, Geir Humborstad Sørland2, Eddy Walter Hansen3, Hege C. Wide

DocID: 19Y8R - View Document

Towards Scalable Algorithms with Formal Guarantees for Lyapunov Analysis of Control Systems via Algebraic Optimization (Tutorial paper for the 53rd IEEE Conference on Decision and Control) Amir Ali Ahmadi and Pablo A. Pa

Towards Scalable Algorithms with Formal Guarantees for Lyapunov Analysis of Control Systems via Algebraic Optimization (Tutorial paper for the 53rd IEEE Conference on Decision and Control) Amir Ali Ahmadi and Pablo A. Pa

DocID: 196Ap - View Document

Finding sparse, equivalent SDPs using linear programming and combinatorial techniques Frank Permenter Abstract— We present a new method for simplifying SDPs that blends aspects of symmetry reduction with sparsity explo

Finding sparse, equivalent SDPs using linear programming and combinatorial techniques Frank Permenter Abstract— We present a new method for simplifying SDPs that blends aspects of symmetry reduction with sparsity explo

DocID: 18KMe - View Document