:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Gupta, Swati, Zhu, Alec
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control Combinatorics 90C25, 90C31
Online Access:	https://arxiv.org/abs/2603.08672
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
by: García-Castaño, Fernando, et al.
Published: (2024)

Qualitative and Generalized Differentiation Properties of Optimal Value Functions with Applications to Duality
by: Long, V. S. T., et al.
Published: (2025)

A Level Set Method with Secant Iterations for the Least-Squares Constrained Nuclear Norm Minimization
by: Ma, Chiyu, et al.
Published: (2026)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
by: García-Castaño, Fernando, et al.
Published: (2024)

Marginal minimization and sup-norm expansions in perturbed optimization
by: Spokoiny, Vladimir
Published: (2025)

Two Proofs of a Structural Theorem of Decreasing Minimization on Integrally Convex Sets
by: Murota, Kazuo, et al.
Published: (2025)

Continuity in Parametric Linear Programming
by: Lahiri, Somdeb
Published: (2024)

Duality of Hoffman constants
by: Pena, Javier F., et al.
Published: (2023)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
by: Meng, Kaiwen, et al.
Published: (2024)

Symmetric and Non-Symmetric Cone Separation via Bishop-Phelps Cones in Normed Spaces
by: García-Castaño, Fernando, et al.
Published: (2025)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
by: Lin, Zhenwei, et al.
Published: (2022)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
by: Geremew, W., et al.
Published: (2026)

Sharp bounds in perturbed smooth optimization
by: Spokoiny, Vladimir
Published: (2025)

Constraint Qualification for Generic Parameter Families of Constraints in Optimization
by: Hamada, Naoki, et al.
Published: (2025)

Aubin Property and Strong Regularity Are Equivalent for Nonlinear Second-Order Cone Programming
by: Chen, Liang, et al.
Published: (2024)

A Linear Parameter-Varying Framework for the Analysis of Time-Varying Optimization Algorithms
by: Jakob, Fabian, et al.
Published: (2025)

Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms
by: McRae, Andrew D.
Published: (2024)

Everything is possible: constructing spectrahedra with prescribed facial dimensions
by: Roshchina, Vera, et al.
Published: (2023)

Achieving $\tilde{\mathcal{O}}(1/N)$ Optimality Gap in Restless Bandits through Gaussian Approximation
by: Yan, Chen, et al.
Published: (2024)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
by: Van Tuyen, Nguyen, et al.
Published: (2024)

On Differential Stability of a Class of Convex Optimization Problems
by: Yen, Nguyen Dong, et al.
Published: (2024)

On Second-Order Cone Functions
by: Jibrin, Shafiu, et al.
Published: (2023)

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
by: Guo, Feng, et al.
Published: (2024)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)

Lipschitz-free Projected Subgradient Method with Time-varying Step-size
by: Xia, Yong, et al.
Published: (2024)

Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
by: Zhu, Zhihan, et al.
Published: (2024)

A symmetric primal-dual algorithmic framework for saddle point problems
by: He, Hongjin, et al.
Published: (2022)

Bilevel Learning via Inexact Stochastic Gradient Descent
by: Salehi, Mohammad Sadegh, et al.
Published: (2025)

Convexoid: A Minimal Theory of Conjugate Convexity
by: Wei, Ningji
Published: (2024)

NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems
by: Liang, Ling, et al.
Published: (2024)

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

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron
by: Cifuentes, Diego, et al.
Published: (2026)

Nesterov's accelerated gradient for unbounded convex functions finds the minimum-norm point in the dual space
by: Sakabe, Keiya
Published: (2026)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
by: Hou, Di, et al.
Published: (2025)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
by: Hou, Di, et al.
Published: (2023)

Asymmetric Long-Step Primal-Dual Interior-Point Methods with Dual Centering
by: Nesterov, Yurii
Published: (2025)

A squared smoothing Newton method for semidefinite programming
by: Liang, Ling, et al.
Published: (2023)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
by: Giang-Tran, Khanh-Hung, et al.
Published: (2023)

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
by: Yang, Lei, et al.
Published: (2023)