Copertina

Unbelievable $O(L^{1.5})$ worst case computational complexity achieved by $spdspds$ algorithm for linear programming problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Halemane, Keshava Prasad
Natura:	Preprint
Pubblicazione:	2014
Soggetti:	Optimization and Control 90C05 F.2.1; G.1.6
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A simple algorithm for the simple bilevel programming (SBP) problem
di: Dempe, Stephan, et al.
Pubblicazione: (2025)

An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
di: Iida, Einosuke, et al.
Pubblicazione: (2023)

An inexact infeasible arc-search interior-point method for linear optimization problems
di: Iida, Einosuke, et al.
Pubblicazione: (2024)

Enhancing Model Based Derivative Free Optimization using Direct Search
di: Li, Zijun, et al.
Pubblicazione: (2026)

Escaping Saddle Points via Curvature-Calibrated Perturbations: A Complete Analysis with Explicit Constants and Empirical Validation
di: Alpay, Faruk, et al.
Pubblicazione: (2025)

Gradient Descent Methods for Regularized Optimization
di: Nikolovski, Filip, et al.
Pubblicazione: (2024)

Decentralized Optimization with Topology-Independent Communication
di: Lin, Ying, et al.
Pubblicazione: (2025)

Complexity and performance for two classes of noise-tolerant first-order algorithms
di: Gratton, S., et al.
Pubblicazione: (2022)

Sufficiently Regularized Nonnegative Quartic Polynomials are Sum-of-Squares
di: Zhu, Wenqi, et al.
Pubblicazione: (2026)

Convergence analysis of accelerated algorithms via a mixed-order dynamical system for separable nonsmooth convex optimization
di: Li, Geng-Hua, et al.
Pubblicazione: (2026)

Multi-fidelity constraints in blackbox optimization
di: Alarie, Stéphane, et al.
Pubblicazione: (2026)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
di: Gratton, Serge, et al.
Pubblicazione: (2024)

Pseudoconvex Problems in Operational Decision Systems: Algorithms for Joint Learning and Optimization
di: Li, Zijun, et al.
Pubblicazione: (2026)

TOPSIS-like metaheuristic for LABS problem
di: Urbańczyk, Aleksandra, et al.
Pubblicazione: (2025)

Sparse Training of Neural Networks based on Multilevel Mirror Descent
di: Lunk, Yannick, et al.
Pubblicazione: (2026)

An objective-function-free algorithm for general smooth constrained optimization
di: Bellavia, S., et al.
Pubblicazione: (2026)

An objective-function-free algorithm for nonconvex stochastic optimization with deterministic equality and inequality constraints
di: Gratton, S., et al.
Pubblicazione: (2026)

Stochastic convergence of parallel asynchronous adaptive first-order methods
di: Gratton, Serge, et al.
Pubblicazione: (2026)

Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
di: Gratton, Serge, et al.
Pubblicazione: (2026)

Joint Pricing and Matching for Resource Allocation Platforms via Min-cost Flow Problem
di: Hikima, Yuya, et al.
Pubblicazione: (2024)

Succinct QUBO formulations for permutation problems by sorting networks
di: Friedl, Katalin, et al.
Pubblicazione: (2026)

A Primal-Dual Frank-Wolfe Algorithm for Linear Programming
di: Hough, Matthew, et al.
Pubblicazione: (2024)

From Non-Identifiability to Goal-Integrated Decision-Making in Parametric Inverse Optimization
di: Ahmadi, Farzin, et al.
Pubblicazione: (2026)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part I: Theory
di: Warme, David M.
Pubblicazione: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part II: Applications and Computational Evidence
di: Warme, David M.
Pubblicazione: (2024)

prunAdag: an adaptive pruning-aware gradient method
di: Porcelli, Margherita, et al.
Pubblicazione: (2025)

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o(ε^{-2})$ rather than $\mathcal{O}(ε^{-2})$
di: Gratton, Serge, et al.
Pubblicazione: (2024)

A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad, Shampoo and Muo
di: Gratton, S., et al.
Pubblicazione: (2026)

A Simple First-Order Algorithm for Full-Rank Equality Constrained Optimization
di: Gratton, Serge, et al.
Pubblicazione: (2025)

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity
di: Gratton, Serge, et al.
Pubblicazione: (2024)

Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization
di: Bellavia, S., et al.
Pubblicazione: (2025)

A Riemannian Variational and Spectral Framework for High-Dimensional Sphere Packing: Barrier-Dynamics Reconciliation, Periodic Rigidity, and Discrete-Time Guarantees
di: Alpay, Faruk, et al.
Pubblicazione: (2025)

An improved approximation algorithm for k-Median
di: Young, Neal E.
Pubblicazione: (2025)

Measuring diversity. A review and an empirical analysis
di: Parreño, Francisco, et al.
Pubblicazione: (2024)

Where's Ben Nevis? A 2D optimisation benchmark with 957,174 local optima based on Great Britain terrain data
di: Wei, Yuhang, et al.
Pubblicazione: (2024)

Data-Dependent Complexity of First-Order Methods for Binary Classification
di: Hough, Matthew, et al.
Pubblicazione: (2025)

Projections onto Spectral Matrix Cones
di: Cederberg, Daniel, et al.
Pubblicazione: (2025)

Zeroth-order gradient estimators for stochastic problems with decision-dependent distributions
di: Hikima, Yuya, et al.
Pubblicazione: (2025)

A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
di: Fu, Wenhao, et al.
Pubblicazione: (2023)

Random-key genetic algorithms: Principles and applications
di: Londe, Mariana A., et al.
Pubblicazione: (2025)