:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Müller, Nils
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Computer Vision and Pattern Recognition Machine Learning 90C27 (Primary) 90C05, 65J20 (Secondary)
Online Access:	https://arxiv.org/abs/2511.20607
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure
by: Kempke, Nils-Christian, et al.
Published: (2024)

On generalized KKT points for the Motzkin-Straus program
by: Beretta, G., et al.
Published: (2023)

Relaxed Weak Accelerated Proximal Gradient Method: a Unified Framework for Nesterov's Accelerations
by: Li, Hongda, et al.
Published: (2025)

A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions
by: Bao, Chenglong, et al.
Published: (2025)

Heavy-ball Differential Equation Achieves $O(\varepsilon^{-7/4})$ Convergence for Nonconvex Functions
by: Okamura, Kaito, et al.
Published: (2024)

Box Allocation Optimization in Meal Kit Delivery
by: Nguyen, Thi Minh Thu, et al.
Published: (2025)

Efficient Learning for Entropy-Regularized Markov Decision Processes via Multilevel Monte Carlo
by: Meunier, Matthieu, et al.
Published: (2025)

Efficiency and Convergence Insights in Large-Scale Optimization Using the Improved Inexact-Newton-Smart Algorithm and Interior-Point Framework
by: Renani, Neda Bagheri, et al.
Published: (2025)

A divergence-based condition to ensure quantile improvement in black-box global optimization
by: Guilmeau, Thomas, et al.
Published: (2024)

Parameter-free accelerated gradient descent for nonconvex minimization
by: Marumo, Naoki, et al.
Published: (2022)

Accelerated-gradient-based generalized Levenberg--Marquardt method with oracle complexity bound and local quadratic convergence
by: Marumo, Naoki, et al.
Published: (2022)

Sailing League Problems
by: Schüler, Robert, et al.
Published: (2022)

Global optimization of multivariable functions satisfying the Vanderbei condition
by: Arutyunova, Natalya, et al.
Published: (2019)

Accelerated Proximal Gradient Methods in the affine-quadratic case: Strong convergence and limit identification
by: Moursi, Walaa M., et al.
Published: (2025)

Entropic Mirror Descent for Linear Systems: Polyak's Stepsize and Implicit Bias
by: Malitsky, Yura, et al.
Published: (2025)

Learning to Choose Branching Rules for Nonconvex MINLPs
by: Berthold, Timo, et al.
Published: (2026)

Trust-Region Method for Optimization of Set-Valued Maps Given by Finitely Many Functions
by: Ghosh, Suprova, et al.
Published: (2025)

A solution procedure for minimizing total completion time in a parallel-batching environment
by: Alfieri, Arianna, et al.
Published: (2020)

Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
by: Druetto, Alessandro, et al.
Published: (2024)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
by: Yang, Dominic, et al.
Published: (2025)

An Inexact Modified Quasi-Newton Method for Nonsmooth Regularized Optimization
by: Allaire, Nathan, et al.
Published: (2025)

Strong Convergence of FISTA for Affinely Constrained Convex Quadratic Minimization
by: Bartz, Sedi, et al.
Published: (2026)

The adjoint state method for parametric definable optimization without smoothness or uniqueness
by: Bolte, Jérôme, et al.
Published: (2026)

A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth
by: Li, Hongda, et al.
Published: (2026)

Reinforcement-learning-based Algorithms for Optimization Problems and Applications to Inverse Problems
by: Xu, Chen, et al.
Published: (2023)

Distributed Parallel Structure-Aware Presolving for Arrowhead Linear Programs
by: Kempke, Nils-Christian, et al.
Published: (2026)

A Dual Method for Minimax Quadratic Programming
by: Ren, Wenhui, et al.
Published: (2025)

Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization
by: Nozawa, Ryota, et al.
Published: (2024)

Developing heuristic solution techniques for large-scale unit commitment models
by: Kempke, Nils-Christian, et al.
Published: (2025)

Minimizing the determinant of the graph Laplacian
by: Albin, Nathan, et al.
Published: (2024)

A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming
by: Huo, Xinyue, et al.
Published: (2024)

Predict-then-Calibrate: A New Perspective of Robust Contextual LP
by: Sun, Chunlin, et al.
Published: (2023)

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
by: Gu, Ran, et al.
Published: (2021)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
by: Chen, Kaihuang, et al.
Published: (2025)

A model-free approach for solving choice-based competitive facility location problems using simulation and submodularity
by: Legault, Robin, et al.
Published: (2022)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
by: Jung, Woosuk L., et al.
Published: (2023)

Asymptotic Linear Convergence of ADMM for Isotropic TV Norm Compressed Sensing
by: Torres, Emmanuel Gil, et al.
Published: (2025)

Steiner Cut Dominants
by: Conforti, Michele, et al.
Published: (2022)

Solving Min-Cost Concave Generalized Dynamic Flows and Approximating Dynamic Optimal Power Flows
by: Rothschild, Jacob H.
Published: (2024)

The Golden Ratio Proximal ADMM with Norm Independent Step-Sizes for Separable Convex Optimization
by: Soe, Santanu, et al.
Published: (2025)