We propose a new class of convex penalty functions, called variational Gram functions (VGFs), that can promote pairwise relations, such as orthogonality, among a set of vectors in a vector space. These functions can serv

Source URL: mmds-data.org

Monday 9:00 am 9:30 am 10:00 am

Source URL: quentin.mrgt.fr

• Convex analysis
• Convex geometry
• Convex set
• Lunch
• Convex function
• Topology

With the advent of massive data sets, statistical learning and information processing techniques are expected to enable unprecedented possibilities for better decision making. However, existing algorithms for mathematica

Source URL: mmds-data.org

• Mathematical optimization
• Cybernetics
• Operations research
• Machine learning
• Convex optimization
• Global optimization
• Book:Optimization

Journal of Machine Learning Research) ??-?? Submitted; Revised; PublishedEfficient Online and Batch Learning using Forward Backward Splitting

Source URL: stanford.edu

• Mathematical optimization
• Convex analysis
• Convex optimization
• Subgradient method
• Gradient descent
• Lipschitz continuity
• Subderivative
• Support vector machine

c 2010 Society for Industrial and Applied Mathematics  SIAM J. OPTIM. Vol. 0, No. 0, pp. 000–000

Source URL: theory.stanford.edu

• Mathematical optimization
• Operations research
• Convex optimization
• Linear algebra
• Linear programming
• Duality
• Eigenvalues and eigenvectors
• Constrained optimization
• Algorithm
• Linear complementarity problem
• Convex analysis

50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl

Source URL: people.inf.ethz.ch

• Operations research
• Linear programming
• Convex optimization
• Combinatorial optimization
• Computational geometry
• Bounding sphere
• LP-type problem
• Simplex algorithm
• Time complexity
• Mathematical optimization
• Integer programming
• Duality

Abstracts of MMA2014, May, 2014, Druskininkai, Lithuania c VGTU, 2014 B−1 -CONVEX FUNCTIONS AND SOME IMPORTANT PROPERTIES

Source URL: inga.vgtu.lt

• Partial differential equations
• Convex analysis
• Mathematical optimization
• Variational analysis
• Convex function
• Differential equation
• Variational inequality
• Interpolation
• Finite difference
• operator

393 Documenta Math. On Packing Spheres into Containers About Kepler’s Finite Sphere Packing Problem

Source URL: documenta.sagemath.org

• Convex analysis
• Convex set
• Convex hull
• Limit of a function

Constructing Shaded Maps with the DIME Topological Structure: An Alternative to the Polygon Approach Michael E. Hodgson Geography Department University of South Carolina ABSTRACT

Source URL: mapcontext.com

• Polygons
• Computational geometry
• Convex geometry
• Euclidean plane geometry
• Shading
• Convex polygon
• Intersection
• Simple polygon
• Monotone polygon

Typical Properties of Winners and Losers in Discrete Optimization Rene Beier∗ Max-Planck-Institut f¨ur Informatik Saarbr¨ucken

Source URL: www-i1.informatik.rwth-aachen.de

• Operations research
• Mathematical optimization
• Stochastic processes
• Convex optimization
• Expected value
• Normal distribution
• Probability density function
• Stochastic programming
• Convergence of random variables