Can we accelerate the convergence of gradient descent without changing the algorithm— just by judiciously choosing stepsizes? Surprisingly, we show that the answer is yes. Our …
The proximal gradient algorithm for minimizing the sum of a smooth and nonsmooth convex function often converges linearly even without strong convexity. One common reason is that …
This is the first comprehensive introduction to the powerful moment approach for solving global optimization problems (and some related problems) described by polynomials (and …
Planning algorithms are impacting technical disciplines and industries around the world, including robotics, computer-aided design, manufacturing, computer graphics, aerospace …
Tropical geometry is a combinatorial shadow of algebraic geometry, offering new polyhedral tools to compute invariants of algebraic varieties. It is based on tropical algebra, where the …
In this article, the basic constructs of algebraic kinematics (links, joints, and mechanism spaces) are introduced. This provides a common schema for many kinds of problems that …
The advent of high-speed computers and sophisticated software tools has made the computation of derivatives for functions defined by evaluation programs both easier and …
This book is primarily a textbook introduction to various areas of discrete geometry. In each area, it explains several key results and methods, in an accessible and concrete manner. It …
Nonlinear algebra provides modern mathematical tools to address challenges arising in the sciences and engineering. It is useful everywhere, where polynomials appear: in particular …