Results 1 to 10 of about 4,170,443 (279)
Implementable tensor methods in unconstrained convex optimization. [PDF]
In this paper we develop new tensor methods for unconstrained convex optimization, which solve at each iteration an auxiliary problem of minimizing convex multivariate polynomial.
Nesterov Y.
europepmc +2 more sources
Convex and Non-Convex Optimization under Generalized Smoothness [PDF]
Classical analysis of convex and non-convex optimization methods often requires the Lipshitzness of the gradient, which limits the analysis to functions bounded by quadratics.
Haochuan Li+4 more
semanticscholar +1 more source
Motion planning around obstacles with convex optimization [PDF]
From quadrotors delivering packages in urban areas to robot arms moving in confined warehouses, motion planning around obstacles is a core challenge in modern robotics.
Tobia Marcucci+3 more
semanticscholar +1 more source
Quasi Semi and Pseudo Semi (p,E)-Convexity in Non-Linear Optimization Programming
The class of quasi semi -convex functions and pseudo semi -convex functions are presented in this paper by combining the class of -convex functions with the class of quasi semi -convex functions and pseudo semi -convex functions, respectively.
Revan I. Hazim, Saba N. Majeed
doaj +1 more source
Optimization Method for Wide Beam Sonar Transmit Beamforming
Imaging and mapping sonars such as forward-looking sonars (FLS) and side-scan sonars (SSS) are sensors frequently used onboard autonomous underwater vehicles.
Louise Rixon Fuchs+2 more
doaj +1 more source
Private stochastic convex optimization: optimal rates in linear time [PDF]
We study differentially private (DP) algorithms for stochastic convex optimization: the problem of minimizing the population loss given i.i.d. samples from a distribution over convex loss functions. A recent work of Bassily et al.
V. Feldman, Tomer Koren, Kunal Talwar
semanticscholar +1 more source
This textbook is based on lectures given by the authors at MIPT (Moscow), HSE (Moscow), FEFU (Vladivostok), V.I. Vernadsky KFU (Simferopol), ASU (Republic of Adygea), and the University of Grenoble-Alpes (Grenoble, France).
Stephen P. Boyd, L. Vandenberghe
semanticscholar +1 more source
Exact Matrix Completion via Convex Optimization [PDF]
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M.
E. Candès, B. Recht
semanticscholar +1 more source
Quantum algorithms and lower bounds for convex optimization [PDF]
While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization.
Shouvanik Chakrabarti+3 more
doaj +1 more source
Meta-Learning With Differentiable Convex Optimization [PDF]
Many meta-learning approaches for few-shot learning rely on simple base learners such as nearest-neighbor classifiers. However, even in the few-shot regime, discriminatively trained linear predictors can offer better generalization.
Kwonjoon Lee+3 more
semanticscholar +1 more source