:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Lozovanu, Dmitrii
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 65K05, 68Q17
Online Access:	https://arxiv.org/abs/2502.08286
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
by: Tawarmalani, Mohit
Published: (2024)

An optimally fast objective-function-free minimization algorithm using random subspaces
by: Bellavia, S., et al.
Published: (2023)

An adaptive framework for first-order gradient methods
by: Hu, Xiaozhe, et al.
Published: (2026)

A practical randomized trust-region method to escape saddle points in high dimension
by: Dragomir, Radu-Alexandru, et al.
Published: (2026)

An Operator Learning Approach to Nonsmooth Optimal Control of Nonlinear PDEs
by: Song, Yongcun, et al.
Published: (2024)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
by: Yang, Xiangyu, et al.
Published: (2021)

Well-posedness and mean-field limit estimate of a consensus-based algorithm for min-max problems
by: Huang, Hui, et al.
Published: (2026)

Retraction based regression methods on Riemannian manifolds
by: Loayza-Romero, Estefanía, et al.
Published: (2026)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

A modularized algorithmic framework for interface related optimization problems using characteristic functions
by: Wang, Dong, et al.
Published: (2022)

A non-iterative polynomial algorithm for linear programming
by: Jing-Yuan, Wei
Published: (2013)

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

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

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

Curvature-Aware Derivative-Free Optimization
by: Kim, Bumsu, et al.
Published: (2021)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
by: Curtis, Frank E., et al.
Published: (2025)

A Proximal-Gradient Method for Constrained Optimization
by: Dai, Yutong, et al.
Published: (2024)

An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function
by: Gillis, Nicolas, et al.
Published: (2025)

Convergence of Momentum-Based Optimization Algorithms with Time-Varying Parameters
by: Vidyasagar, Mathukumalli
Published: (2025)

A Polynomial-time Algorithm to Solve the Airplane Refueling Problem: the Sequential Search Algorithm
by: Cui, Jinchuan, et al.
Published: (2022)

Consensus-based optimization for closed-box adversarial attacks and a connection to evolution strategies
by: Roith, Tim, et al.
Published: (2025)

Tracking controllability on moving targets for parabolic equations
by: Apraiz, Jone, et al.
Published: (2026)

A particle consensus approach to solving nonconvex-nonconcave min-max problems
by: Borghi, Giacomo, et al.
Published: (2024)

Optimization in Theory and Practice
by: Wright, Stephen J.
Published: (2025)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
by: Zhang, Chenyu, et al.
Published: (2023)

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space
by: Burns, Matthew X., et al.
Published: (2025)

A network based approach for unbalanced optimal transport on surfaces
by: Pan, Jiangong, et al.
Published: (2024)

Generalized sparsity-promoting solvers for Bayesian inverse problems: Versatile sparsifying transforms and unknown noise variances
by: Lindbloom, Jonathan, et al.
Published: (2024)

A new optimal control algorithm for the Keller-Segel problem
by: Guillen-Gonzalez, F., et al.
Published: (2026)

A Riemannian approach for PDE-constrained shape optimization over the diffeomorphism group using outer metrics
by: Loayza-Romero, Estefania, et al.
Published: (2025)

Stochastic Mirror Descent for Convex Optimization with Consensus Constraints
by: Borovykh, Anastasia, et al.
Published: (2022)

An inertial iteratively regularized extragradient method for bilevel variational inequality problems
by: Alves, M. Marques, et al.
Published: (2025)

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

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

Fixed-Point Neural Optimal Transport without Implicit Differentiation
by: Park, Yesom, et al.
Published: (2026)

The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness
by: Azizian, Waïss, et al.
Published: (2022)

A First Step Towards Mesh-Free Probabilistic Shape Optimization
by: Schmidt, Stephan, et al.
Published: (2026)

Topological structure and a polynomial-time solution of linear programming over the real numbers
by: Wei, Jing-Yuan
Published: (2018)

The Pontryagin Maximum Principle for Training Convolutional Neural Networks
by: Hofmann, Sebastian, et al.
Published: (2025)

Handbook of Convergence Theorems for (Stochastic) Gradient Methods
by: Garrigos, Guillaume, et al.
Published: (2023)