:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Gomez, Andres, Han, Shaoning
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2507.00442
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Convex Submodular Minimization with Indicator Variables
by: Han, Shaoning, et al.
Published: (2022)

A Geometric Perspective on Polynomially Solvable Convex Maximization
by: Han, Shaoning, et al.
Published: (2026)

Robust support vector machines via conic optimization
by: Cepeda, Valentina, et al.
Published: (2024)

Rank-one convexification for quadratic optimization problems with step function penalties
by: Choi, Soobin, et al.
Published: (2025)

Solving Convex Quadratic Optimization with Indicators Over Structured Graphs
by: Bhathena, Aaresh, et al.
Published: (2026)

Real-time solution of quadratic optimization problems with banded matrices and indicator variables
by: Gomez, Andres, et al.
Published: (2024)

A Parametric Approach for Solving Convex Quadratic Optimization with Indicators Over Trees
by: Bhathena, Aaresh, et al.
Published: (2024)

Sparse Submodular Function Minimization
by: Graur, Andrei, et al.
Published: (2023)

Improving the Solution of Indefinite Quadratic Programs and Linear Programs with Complementarity Constraints by a Progressive MIP Method
by: Zhang, Xinyao, et al.
Published: (2024)

A Variable Smoothing for Weakly Convex Composite Minimization with Manifold Constraint via Parametrization
by: Kume, Keita, et al.
Published: (2024)

Convexification of Multi-period Quadratic Programs with Indicators
by: Lee, Jisun, et al.
Published: (2024)

A Proximal Variable Smoothing for Nonsmooth Minimization Involving Weakly Convex Composite with MIMO Application
by: Kume, Keita, et al.
Published: (2024)

Online Submodular Maximization via Online Convex Optimization
by: Salem, Tareq Si, et al.
Published: (2023)

Discrete and Continuous Difference of Submodular Minimization
by: Orfanides, George, et al.
Published: (2025)

Bridging the Gap Between General and Down-Closed Convex Sets in Submodular Maximization
by: Mualem, Loay, et al.
Published: (2024)

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
by: Chari, Govind M., et al.
Published: (2026)

Polyhedral Analysis of Quadratic Optimization Problems with Stieltjes Matrices and Indicators
by: Liu, Peijing, et al.
Published: (2024)

Complexity of Minimizing Regularized Convex Quadratic Functions
by: Thomsen, Daniel Berg, et al.
Published: (2024)

A Proximal Descent Method for Minimizing Weakly Convex Optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

On the Set of Possible Minimizers of a Sum of Convex Functions
by: Zamani, Moslem, et al.
Published: (2024)

Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets
by: Lu, Yiyang, et al.
Published: (2026)

High-order Accumulative Regularization for Gradient Minimization in Convex Programming
by: Ji, Yao, et al.
Published: (2025)

Difference of Submodular Minimization via DC Programming
by: Halabi, Marwa El, et al.
Published: (2023)

Estimating Sequences with Memory for Minimizing Convex Non-smooth Composite Functions
by: Dosti, Endrit, et al.
Published: (2025)

Faster Parametric Submodular Function Minimization by Exploiting Duality
by: Gupta, Swati, et al.
Published: (2026)

Over-Approximating Minimizer Sets of Constrained Convex Programs with Parametric Uncertainty via Reachability Analysis
by: Gould, Brendan, et al.
Published: (2026)

Variable Aggregation-based Perspective Reformulation for Mixed-Integer Convex Optimization with Symmetry
by: Wu, Junhao, et al.
Published: (2026)

Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets
by: Grimmer, Benjamin, et al.
Published: (2026)

Online Dynamic Submodular Optimization
by: Lesage-Landry, Antoine, et al.
Published: (2023)

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

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions
by: Van Scoy, Bryan, et al.
Published: (2025)

Multilinear Extensions in Submodular Optimization for Optimal Sensor Scheduling in Nonlinear Networks
by: Kazma, Mohamad H., et al.
Published: (2024)

A Convex-Nonconvex Framework for Enhancing Minimization Induced Penalties
by: Kuroda, Hiroki
Published: (2024)

Sum of Squares Submodularity
by: Deza, Anna, et al.
Published: (2025)

$γ$-weakly $θ$-up-concavity: A Unified Framework for Non-Convex Optimization Beyond DR-Submodular and OSS Functions
by: Pedramfar, Mohammad, et al.
Published: (2026)

Exact Instance Compression for Convex Empirical Risk Minimization via Color Refinement
by: Zhu, Bryan, et al.
Published: (2026)

Variable Bregman Majorization-Minimization algorithms for nonconvex nonsmooth optimization, with application to Poisson imaging
by: Adly, Maxence, et al.
Published: (2026)

Submodular Order Functions and Assortment Optimization
by: Udwani, Rajan
Published: (2021)

Integrating Aggregated Electric Vehicle Flexibilities in Unit Commitment Models using Submodular Optimization
by: Arvis, Hélène, et al.
Published: (2025)

Randomized Greedy Methods for Weak Submodular Sensor Selection with Robustness Considerations
by: Kaya, Ege C., et al.
Published: (2024)