Paperlayer

Optimization and Control

Papers filed under math.OC on arXiv, each one already summarized by Paperlayer. Open any of them to read the summary beside the original PDF, with every point linked to the line, figure, or table it came from.

Search paper metadata (including unsummarized papers)

1,501 to 1,560 of 1,591

  1. Mirror descent algorithms with logarithmic barriers

    Alberto De Marchi, Yura Malitsky, Adrien B. Taylor

    math.OCcs.LGmath.NAarXiv:2608.22834v12026

  2. Stable Architectures for Deep Neural Networks

    Eldad Haber, Lars Ruthotto

    cs.LGmath.NAmath.OCarXiv:1705.03341v32017

  3. Synchronization in Networks of Identical Linear Systems

    Luca Scardovi, Rodolphe Sepulchre

    math.OCarXiv:0805.3456v12008

  4. Homogeneous Approximation, Recursive Observer Design, and Output Feedback

    Vincent Andrieu, Laurent Praly, Alessandro Astolfi

    math.OCarXiv:0903.0298v12009

  5. Nature-Inspired Optimization Algorithms: Challenges and Open Problems

    Xin-She Yang

    cs.NEcs.LGmath.OCarXiv:2003.03776v12020

  6. Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization

    S. Sundhar Ram, A. Nedich, V. V. Veeravalli

    math.OCarXiv:0811.2595v12008

  7. Kron Reduction of Graphs with Applications to Electrical Networks

    Florian Dorfler, Francesco Bullo

    math.COcs.DMeess.SYarXiv:1102.2950v12011

  8. To sample or not to sample: Self-triggered control for nonlinear systems

    Adolfo Anta, Paulo Tabuada

    math.OCmath.DSarXiv:0806.0709v12008

  9. Input Convex Neural Networks

    Brandon Amos, Lei Xu, J. Zico Kolter

    cs.LGmath.OCarXiv:1609.07152v32016

  10. Sparsity-promoting dynamic mode decomposition

    Mihailo R. Jovanović, Peter J. Schmid, Joseph W. Nichols

    physics.flu-dynmath.DSmath.OCarXiv:1309.4165v12013

  11. Learned Primal-dual Reconstruction

    Jonas Adler, Ozan Öktem

    math.OCcs.CVcs.NEarXiv:1707.06474v32017

  12. Differentiable Convex Optimization Layers

    Akshay Agrawal, Brandon Amos, Shane Barratt +3

    cs.LGmath.OCstat.MLarXiv:1910.12430v12019

  13. Is Q-learning Provably Efficient?

    Chi Jin, Zeyuan Allen-Zhu, Sebastien Bubeck +1

    cs.LGcs.AImath.OCarXiv:1807.03765v12018

  14. Bat Algorithm: Literature Review and Applications

    Xin-She Yang

    cs.AImath.OCarXiv:1308.3900v12013

  15. Designing Fully Distributed Consensus Protocols for Linear Multi-agent Systems with Directed Graphs

    Zhongkui Li, Guanghui Wen, Zhisheng Duan +1

    math.OCeess.SYarXiv:1312.7377v22013

  16. FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantization

    Amirhossein Reisizadeh, Aryan Mokhtari, Hamed Hassani +2

    cs.LGcs.DCmath.OCarXiv:1909.13014v42019

  17. Convex Relaxation of Optimal Power Flow, Part I: Formulations and Equivalence

    Steven H. Low

    math.OCeess.SYarXiv:1405.0766v12014

  18. Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems

    Mingyi Hong, Zhi-Quan Luo, Meisam Razaviyayn

    math.OCarXiv:1410.1390v22014

  19. Firefly Algorithm, Levy Flights and Global Optimization

    Xin-She Yang

    math.OCarXiv:1003.1464v12010

  20. Firefly Algorithm: Recent Advances and Applications

    Xin-She Yang, Xingshi He

    math.OCcs.AIarXiv:1308.3898v12013

  21. Meta-Learning with Implicit Gradients

    Aravind Rajeswaran, Chelsea Finn, Sham Kakade +1

    cs.LGcs.AImath.OCarXiv:1909.04630v12019

  22. On Lazy Training in Differentiable Programming

    Lenaic Chizat, Edouard Oyallon, Francis Bach

    math.OCcs.LGarXiv:1812.07956v52018

  23. Cuckoo Search: Recent Advances and Applications

    Xin-She Yang, Suash Deb

    math.OCcs.NEnlin.AOarXiv:1408.5316v12014

  24. A Simpler Approach to Matrix Completion

    Benjamin Recht

    cs.ITmath.NAmath.OCarXiv:0910.0651v22009

  25. Primal Acceleration of Newton's Method

    Nikita Doikov

    math.OCcs.AIcs.LGarXiv:2608.21359v12026

  26. Anchored Regularized Direct Least Squares (ARDLS): Integrating Established Prioritization Operators for Priority Elicitation in the Analytic Hierarchy Process

    Kevin Kam Fung Yuen

    math.OCcs.AImath.NAarXiv:2608.21187v12026

  27. Vehicle Routing Problems for Drone Delivery

    Kevin Dorling, Jordan Heinrichs, Geoffrey G. Messier +1

    math.OCarXiv:1608.02305v12016

  28. An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems

    Manya V. Afonso, José M. Bioucas-Dias, Mário A. T. Figueiredo

    math.OCmath.NAarXiv:0912.3481v12009

  29. Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization

    Shiqian Ma, Donald Goldfarb, Lifeng Chen

    math.OCcs.ITarXiv:0905.1643v22009

  30. Low-rank Matrix Completion using Alternating Minimization

    Prateek Jain, Praneeth Netrapalli, Sujay Sanghavi

    stat.MLcs.LGmath.OCarXiv:1212.0467v12012

  31. Rank-Sparsity Incoherence for Matrix Decomposition

    Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Parrilo +1

    math.OCmath.STarXiv:0906.2220v12009

  32. Manopt, a Matlab toolbox for optimization on manifolds

    Nicolas Boumal, Bamdev Mishra, P. -A. Absil +1

    cs.MScs.LGmath.OCarXiv:1308.5200v12013

  33. EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization

    Wei Shi, Qing Ling, Gang Wu +1

    math.OCarXiv:1404.6264v42014

  34. Exploiting Shared Representations for Personalized Federated Learning

    Liam Collins, Hamed Hassani, Aryan Mokhtari +1

    cs.LGmath.OCarXiv:2102.07078v32021

  35. NESTA: A Fast and Accurate First-order Method for Sparse Recovery

    Stephen Becker, Jerome Bobin, Emmanuel Candes

    math.OCarXiv:0904.3367v12009

  36. Gradient Descent Finds Global Minima of Deep Neural Networks

    Simon S. Du, Jason D. Lee, Haochuan Li +2

    cs.LGcs.AIcs.CVarXiv:1811.03804v42018

  37. Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing

    Junfeng Yang, Yin Zhang

    math.OCarXiv:0912.1185v12009

  38. Local SGD Converges Fast and Communicates Little

    Sebastian U. Stich

    math.OCcs.DCcs.LGarXiv:1805.09767v32018

  39. Linear predictors for nonlinear dynamical systems: Koopman operator meets model predictive control

    Milan Korda, Igor Mezić

    math.OCarXiv:1611.03537v32016

  40. Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation

    Zhouchen Lin, Risheng Liu, Zhixun Su

    math.OCarXiv:1109.0367v12011

  41. OptNet: Differentiable Optimization as a Layer in Neural Networks

    Brandon Amos, J. Zico Kolter

    cs.LGcs.AImath.OCarXiv:1703.00443v52017

  42. signSGD: Compressed Optimisation for Non-Convex Problems

    Jeremy Bernstein, Yu-Xiang Wang, Kamyar Azizzadenesheli +1

    cs.LGcs.DCmath.OCarXiv:1802.04434v32018

  43. A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights

    Weijie Su, Stephen Boyd, Emmanuel J. Candes

    stat.MLmath.CAmath.OCarXiv:1503.01243v22015

  44. Global Convergence of ADMM in Nonconvex Nonsmooth Optimization

    Yu Wang, Wotao Yin, Jinshan Zeng

    math.OCmath.NAarXiv:1511.06324v82015

  45. Phase Retrieval via Wirtinger Flow: Theory and Algorithms

    Emmanuel Candes, Xiaodong Li, Mahdi Soltanolkotabi

    cs.ITmath.FAmath.NAarXiv:1407.1065v32014

  46. A Literature Survey of Benchmark Functions For Global Optimization Problems

    Momin Jamil, Xin-She Yang

    cs.AImath.OCarXiv:1308.4008v12013

  47. Proximal alternating minimization and projection methods for nonconvex problems. An approach based on the Kurdyka-Lojasiewicz inequality

    Hedy Attouch, Jerome Bolte, Patrick Redont +1

    math.OCarXiv:0801.1780v32008

  48. Train faster, generalize better: Stability of stochastic gradient descent

    Moritz Hardt, Benjamin Recht, Yoram Singer

    cs.LGmath.OCstat.MLarXiv:1509.01240v22015

  49. Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descent

    Xiangru Lian, Ce Zhang, Huan Zhang +3

    math.OCcs.DCcs.LGarXiv:1705.09056v52017

  50. Identifying and attacking the saddle point problem in high-dimensional non-convex optimization

    Yann Dauphin, Razvan Pascanu, Caglar Gulcehre +3

    cs.LGmath.OCstat.MLarXiv:1406.2572v12014

  51. Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition

    Hamed Karimi, Julie Nutini, Mark Schmidt

    cs.LGmath.OCstat.COarXiv:1608.04636v42016

  52. JuMP: A Modeling Language for Mathematical Optimization

    Iain Dunning, Joey Huchette, Miles Lubin

    math.OCcs.MSarXiv:1508.01982v32015

  53. Provable defenses against adversarial examples via the convex outer adversarial polytope

    Eric Wong, J. Zico Kolter

    cs.LGcs.AImath.OCarXiv:1711.00851v32017

  54. Coordinate Descent Algorithms

    Stephen J. Wright

    math.OCarXiv:1502.04759v12015

  55. A Convergence Theory for Deep Learning via Over-Parameterization

    Zeyuan Allen-Zhu, Yuanzhi Li, Zhao Song

    cs.LGcs.DScs.NEarXiv:1811.03962v52018

  56. Engineering Optimisation by Cuckoo Search

    Xin-She Yang, Suash Deb

    math.OCstat.COarXiv:1005.2908v32010

  57. Dynamic Triggering Mechanisms for Event-Triggered Control

    Antoine Girard

    eess.SYmath.OCarXiv:1301.2182v32013

  58. Constrained Efficient Global Optimization of Expensive Black-box Functions

    Wenjie Xu, Yuning Jiang, Bratislav Svetozarevic +1

    math.OCarXiv:2211.00162v42022

  59. Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programming

    Saeed Ghadimi, Guanghui Lan

    math.OCcs.CCstat.MLarXiv:1309.5549v12013

  60. SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives

    Aaron Defazio, Francis Bach, Simon Lacoste-Julien

    cs.LGmath.OCstat.MLarXiv:1407.0202v32014