90c06

Documents about 90c06

• Envelopt: Constrained Convex Composite Optimization#1077449arXiv (All)
• Primal-Dual Adaptive Subgradient Methods#1412271arXiv (All)
• GPU-Accelerated Preprocessing for Large-Scale Linear Programming#1354523arXiv (All)
• Randomized subspace correction methods for convex optimization#173322arXiv (OAI)
• Practical Regularized Quasi-Newton Methods with Inexact Function Values#1327345arXiv (All)
• Adaptive Variance-Reduced Stochastic Sequential (Quadratic Constrained) Quadratic Programming#1343938arXiv (All)
• Random-subspace Ellipsoidal Trust-region Methods for Derivative-free Optimization#1389812arXiv (All)
• Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization#674148arXiv (OAI Expanded)
• Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization#677345arXiv (All)
• Primal-Dual Inexact Newton-MR for Nonconvex Optimization with Equality Constraints#996513arXiv (All)
• A sequential smoothing majorant stochastic approximation method for nonconvex nonconcave minimax problems#998722arXiv (All)
• Structured Spectral Step-Sizes and Rebound-Aware Ordering for Gradient Methods#1064904arXiv (All)
• TIGER: Tunable-Geometry Accelerated Gradient Sliding with Adaptive Safeguards under Similarity#1400329arXiv (All)
• CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization#984870arXiv (All)
• Rank-Adaptive and Linearly Convergent Frank--Wolfe Method over Spectrahedron via Nonconvex Oracle#985869arXiv (All)
• Decomposition of Sparse Integer Programs via Nonlinear Edge Encodings and Column-and-Row Generation#972716arXiv (All)
• Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems#996852arXiv (All)
• Provable Parameter-Free Fixed-Point Algorithms with Linear Convergence Rates#1296470arXiv (All)
• A Smoothed Augmented Lagrangian Method for Mathematical Programs with Vertical Complementarity Constraints#1343243arXiv (All)
• Sparse plus low-rank matrix embedding with applications in cancer radiotherapy optimization#972746arXiv (All)
• Doubly exponential convergence of the cyclic steepest descent method for strictly convex quadratics in arbitrary dimensions#1061430arXiv (All)
• Distributed Fast Fixed-Point Algorithms for Composite Monotone Inclusions over Networks#1084857arXiv (OAI Expanded)
• An Adaptive Linesearch-free Method for Monotone Variational Inequalities under Local Lipschitz Continuity#1109966arXiv (OAI Expanded)
• The Numerical Linear Algebra of Large Language Models#1200282arXiv (All)
• A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization#1187210arXiv (All)
• Warm-IP: A Path-Following ADMM Warm Start for Interior-Point Quadratic Programming#1298301arXiv (All)
• On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method#144274arXiv (OAI)
• Breaking the Odd Cycle: Regularization and First-Order Optimization for the Maximum $s$-Plex Problem#1234572arXiv (All)
• BLOKS: Scaling Kernel Solvers with Sketched Block Preconditioning#1297734arXiv (All)
• Empirical risk minimization for risk-neutral composite optimal control with applications to bang-bang control#1013385arXiv (All)
• A New Kernel Regularity Condition for Distributed Mirror Descent: Broader Coverage and Simpler Analysis#973091arXiv (All)
• On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction#1082974arXiv (OAI Expanded)
• A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints#1122944arXiv (OAI Expanded)
• A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure#128328arXiv (OAI)
• Quantum-Classical Hybrid Methods for Optimization: Lessons from Classical Decomposition#1402750arXiv (All)
• Using Subproblem Objective Gaps in Inexact Augmented Lagrangian and ADMM Algorithms, with Applications to Stochastic Mixed Integer Programming#650955arXiv (OAI Expanded)
• Using Subproblem Objective Gaps in Inexact Augmented Lagrangian and ADMM Algorithms, with Applications to Stochastic Mixed Integer Programming#652408arXiv (All)
• A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad and Muon#674378arXiv (OAI Expanded)
• A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad and Muon#677577arXiv (All)
• Global optimization tailored for graphics processing units: Complete and rigorous search for large-scale nonlinear minimization#141775arXiv (OAI)