:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Gokavarapu, Chandrasekhar
Format:	Preprint
Published:	2025
Subjects:	Rings and Algebras 68T07, 68N30, 68Q60, 90C05, 90C25
Online Access:	https://arxiv.org/abs/2512.24379
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Proof-Carrying Verification for ReLU Networks via Rational Certificates
by: Gokavarapu, Chandrasekhar
Published: (2025)

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

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
by: Zhang, Liwei, et al.
Published: (2025)

Barrier Algorithms for Constrained Non-Convex Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Classification by Separating Hypersurfaces: An Entropic Approach
by: Arratia, Argimiro, et al.
Published: (2025)

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

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

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
by: Hua, Zheng, et al.
Published: (2021)

Dimension-free estimators of gradients of functions with(out) non-independent variables
by: Lamboni, Matieyendou
Published: (2025)

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
by: Petrov, Petar P.
Published: (2022)

On the Hardness of Short and Sign-Compatible Circuit Walks
by: Borgwardt, Steffen, et al.
Published: (2024)

An Augmented Lagrangian Method for Training Recurrent Neural Networks
by: Wang, Yue, et al.
Published: (2024)

Analysis of Kernel Mirror Prox for Measure Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Distributed Computing for Huge-Scale Aggregative Convex Programming
by: Tao, Luoyi
Published: (2026)

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
by: He, Chuan, et al.
Published: (2023)

pFedSOP : Accelerating Training Of Personalized Federated Learning Using Second-Order Optimization
by: Sen, Mrinmay, et al.
Published: (2025)

A semidefinite programming characterization of the Crawford number
by: Friedland, Shmuel, et al.
Published: (2024)

Improved global performance guarantees of second-order methods in convex minimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

PyEPO: A PyTorch-based End-to-End Predict-then-Optimize Library for Linear and Integer Programming
by: Tang, Bo, et al.
Published: (2022)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
by: Mohammadisiahroudi, Mohammadhossein, et al.
Published: (2023)

Accelerated Training of Federated Learning via Second-Order Methods
by: Sen, Mrinmay, et al.
Published: (2025)

A Theoretical Study of (Hyper) Self-Attention through the Lens of Interactions: Representation, Training, Generalization
by: Ustaomeroglu, Muhammed, et al.
Published: (2025)

Integral Biflow Maximization
by: Ding, Guoli, et al.
Published: (2024)

Prime and Semiprime Ideals in Commutative Ternary $Γ$-Semirings: Quotients, Radicals, Spectrum
by: Gokavarapu, Chandrasekhar, et al.
Published: (2025)

CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization
by: Condat, Laurent, et al.
Published: (2022)

Distributed Computing for Huge-Scale Linear Programming
by: Tao, Luoyi
Published: (2024)

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

Stress-Testing Neural Network Verifiers with Provably Robust Instances
by: Troxell, David, et al.
Published: (2026)

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)

On the boundedness of the sequence generated by minibatch stochastic gradient descent
by: Bauschke, Heinz H., et al.
Published: (2025)

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
by: Chiarelli, Nina, et al.
Published: (2023)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
by: Nesterov, Yurii
Published: (2025)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
by: Ouyang, Wenqing, et al.
Published: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
by: Ouyang, Wenqing
Published: (2025)

Fast and Provable Nonconvex Robust Matrix Completion
by: Fu, Yichen, et al.
Published: (2026)

The Optimality of a Nested Generalized Pairwise Group Testing Procedure
by: Malinovsky, Yaakov, et al.
Published: (2025)

The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm
by: Ye, Yuhan, et al.
Published: (2026)

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
by: Friedland, Shmuel
Published: (2023)