:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Halemane, Keshava Prasad
Format:	Preprint
Publié:	2014
Sujets:	Optimization and Control 90C05 F.2.1; G.1.6
Accès en ligne:	https://arxiv.org/abs/1405.6902
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A simple algorithm for the simple bilevel programming (SBP) problem
par: Dempe, Stephan, et autres
Publié: (2025)

An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
par: Iida, Einosuke, et autres
Publié: (2023)

An inexact infeasible arc-search interior-point method for linear optimization problems
par: Iida, Einosuke, et autres
Publié: (2024)

Enhancing Model Based Derivative Free Optimization using Direct Search
par: Li, Zijun, et autres
Publié: (2026)

Gradient Descent Methods for Regularized Optimization
par: Nikolovski, Filip, et autres
Publié: (2024)

Escaping Saddle Points via Curvature-Calibrated Perturbations: A Complete Analysis with Explicit Constants and Empirical Validation
par: Alpay, Faruk, et autres
Publié: (2025)

Convergence analysis of accelerated algorithms via a mixed-order dynamical system for separable nonsmooth convex optimization
par: Li, Geng-Hua, et autres
Publié: (2026)

Sufficiently Regularized Nonnegative Quartic Polynomials are Sum-of-Squares
par: Zhu, Wenqi, et autres
Publié: (2026)

Complexity and performance for two classes of noise-tolerant first-order algorithms
par: Gratton, S., et autres
Publié: (2022)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
par: Gratton, Serge, et autres
Publié: (2024)

Decentralized Optimization with Topology-Independent Communication
par: Lin, Ying, et autres
Publié: (2025)

Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
par: Gratton, Serge, et autres
Publié: (2026)

TOPSIS-like metaheuristic for LABS problem
par: Urbańczyk, Aleksandra, et autres
Publié: (2025)

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

An objective-function-free algorithm for general smooth constrained optimization
par: Bellavia, S., et autres
Publié: (2026)

An objective-function-free algorithm for nonconvex stochastic optimization with deterministic equality and inequality constraints
par: Gratton, S., et autres
Publié: (2026)

Sparse Training of Neural Networks based on Multilevel Mirror Descent
par: Lunk, Yannick, et autres
Publié: (2026)

Pseudoconvex Problems in Operational Decision Systems: Algorithms for Joint Learning and Optimization
par: Li, Zijun, et autres
Publié: (2026)

Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs
par: Ju, Caleb, et autres
Publié: (2023)

Multi-fidelity constraints in blackbox optimization
par: Alarie, Stéphane, et autres
Publié: (2026)

Joint Pricing and Matching for Resource Allocation Platforms via Min-cost Flow Problem
par: Hikima, Yuya, et autres
Publié: (2024)

Succinct QUBO formulations for permutation problems by sorting networks
par: Friedl, Katalin, et autres
Publié: (2026)

A Riemannian Variational and Spectral Framework for High-Dimensional Sphere Packing: Barrier-Dynamics Reconciliation, Periodic Rigidity, and Discrete-Time Guarantees
par: Alpay, Faruk, et autres
Publié: (2025)

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

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

Convex optimization on CAT(0) cubical complexes
par: Goodwin, Ariel, et autres
Publié: (2024)

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity
par: Gratton, Serge, et autres
Publié: (2024)

Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization
par: Bellavia, S., et autres
Publié: (2025)

Stochastic convergence of parallel asynchronous adaptive first-order methods
par: Gratton, Serge, et autres
Publié: (2026)

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
par: Emmerich, Michael T. M., et autres
Publié: (2026)

An improved approximation algorithm for k-Median
par: Young, Neal E.
Publié: (2025)

Conditions when the problems of linear programming are algorithmically unsolvable
par: Chernov, Viktor, et autres
Publié: (2023)

prunAdag: an adaptive pruning-aware gradient method
par: Porcelli, Margherita, et autres
Publié: (2025)

Adam symmetry theorem: characterization of the convergence of the stochastic Adam optimizer
par: Dereich, Steffen, et autres
Publié: (2025)

Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization method
par: Dereich, Steffen, et autres
Publié: (2026)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
par: Ali, Alejandro Mata
Publié: (2025)

Examples of slow convergence for adaptive regularization optimization methods are not isolated
par: Toint, Philippe L.
Publié: (2024)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
par: Emmerich, Michael T. M.
Publié: (2026)

A Generalized Block-Iterative Projection Method for the Common Fixed Point Problem Induced by Cutters
par: Censor, Yair, et autres
Publié: (2022)

A unified worst case for classical simplex and policy iteration pivot rules
par: Disser, Yann, et autres
Publié: (2023)