Preface This text has grown over many years from a set of class notes for an undergraduate linear programming course offered at the University of Wisconsin-Madison. Though targeted to Computer Science undergraduates, the

Source URL: www.siam.org

• Operations research
• Mathematical optimization
• Convex optimization
• Linear programming
• Quadratic programming
• Linear algebra
• Algorithm
• Quadratic

Survivor curve shape and internet revenue: A laboratory experiment. Christina Aperjis HP Labs, 1501 Page Mill Rd, Palo Alto, CACiril Bosch-Rosa

Source URL: www.macroeconomics.tu-berlin.de

• Convex analysis
• Logarithmically concave function
• Convex function
• Concave
• Convex set
• Probability distribution
• Expected value
• Logarithm

A convex optimization approach to generalized moment problems in multivariate spectral estimation Michele Pavon Department of Mathematics University of Padova, Padova, Italy

Source URL: math.nyu.edu

• Signal processing
• Frequency domain analysis
• Estimation theory
• Statistical inference
• Spectral density estimation
• Anders Lindquist

1 Tractable Fully Bayesian Inference via Convex Optimization and Optimal Transport Theory Sanggyun Kim, Diego Mesa, Rui Ma, and Todd P. Coleman

Source URL: arxiv.org

• Convex analysis
• Bayesian statistics
• Statistical theory
• Mathematical economics
• Estimation theory
• KullbackLeibler divergence
• Transportation theory
• Normal distribution
• Expected value
• Conjugate prior
• Mutual information
• Convex function

Overlap of Convex Polytopes under Rigid Motion∗ Hee-Kap Ahn1 Siu-Wing Cheng2 Hyuk Jun Kweon1 Juyoung Yon2 Abstract We present an algorithm to compute a rigid motion that approximately maximizes the volume of the inters

Source URL: www.cse.ust.hk

MONAURAL SEPARATION AND CLASSIFICATION OF NON-LINEAR TRANSFORMED INDEPENDENT SIGNALS: AN SVM PERSPECTIVE Sepp Hochreiter and Michael C. Mozer Department of Computer Science University of Colorado Boulder, CO 80309

Source URL: www.bioinf.jku.at

• Signal processing
• Statistical models
• Convex optimization
• Operations research
• Independent component analysis
• Wavelet
• Linear programming
• Support vector machine
• Matrix
• Machine learning
• Sparse approximation
• Sparse dictionary learning

SIMPLICES AT INFINITY IN CAT(0) CUBE COMPLEXES MARK F. HAGEN These are notes for lectures given in Nice in March 2016, on simplicial boundaries of CAT(0) cube complexes. They cover the denition, basic properties, some

Source URL: www.wescac.net

• Algebraic topology
• Topological spaces
• Homotopy theory
• Geometric group theory
• Triangulation
• Simplicial complex
• Simplex
• Gromov boundary
• Convex set
• CW complex
• Hyperplane
• Arrangement of hyperplanes

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 60, NO. 4, APRILAn Optimizer’s Approach to Stochastic Control Problems With Nonclassical Information Structures

Source URL: coleman.ucsd.edu

• Mathematical optimization
• Transportation theory
• Convex optimization
• Relaxation
• KarushKuhnTucker conditions
• Linear programming
• Optimization problem
• Ratedistortion theory
• Quasigroup
• Lagrange multiplier
• Optimal control
• Equation solving

P R E V I E W S O F W O R K S F O R S A L E AT U P C O M I N G S H O W S C O A S T T O C O A S T ISSUE 120 OCTOBER 2015

Source URL: www.nuartgallery.com

• Algebraic geometry
• Convex analysis
• Convex geometry
• Cone
• Convex cone

General Young’s inequality for real numbers 27 April 2006 Abstract This text contains the statement and proof of Young’s inequality for real numbers and a generalization of it. Its generalization has a nice graphical

Source URL: canizo.org

• Operator theory
• Spectral theory
• Harmonic analysis
• Integral calculus
• Integration by parts
• Convex function
• Spectral theory of ordinary differential equations
• Beltrami equation