:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Salloum, Hadi, Hildebrand, Roland, Nguyen, Nhat Trung, Pirau, Vitali, Badr, Amer Al, Alkousa, Mohammad, Gasnikov, Alexander
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C09, 90C27
Online Access:	https://arxiv.org/abs/2512.08852
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing
by: Fravel, Jamie, et al.
Published: (2026)

Relaxations for binary polynomial optimization via signed certificates
by: Xu, Liding, et al.
Published: (2024)

Optimization in complex spaces with the Mixed Newton Method
by: Bakhurin, Sergey, et al.
Published: (2022)

An ODE approach to multiple choice polynomial programming
by: Shao, Sihong, et al.
Published: (2022)

Hidden convexity of quadratic systems and its application to quadratic programming
by: Huy, Nguyen Quang, et al.
Published: (2026)

On the sparsity of binary numbers
by: Zhu, Meijun
Published: (2024)

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

The Boolean polynomial polytope with multiple choice constraints
by: Shao, Sihong, et al.
Published: (2024)

Minimizing transients via the Kreiss system norm
by: Apkarian, Pierre, et al.
Published: (2023)

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

Existence of solutions for polyhedral convex set optimization problems
by: Löhne, Andreas
Published: (2023)

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

Mixed Newton Method for Optimization in Complex Spaces
by: Yudin, Nikita, et al.
Published: (2024)

Some optimality conditions of set-valued optimization problems in locally convex topological vector spaces
by: Zeng, Renying
Published: (2024)

${\varepsilon}$-optimality in reverse convex optimization
by: Maghri, M. El, et al.
Published: (2025)

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

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
by: Guigues, Vincent, et al.
Published: (2017)

Sparse convex relaxations in polynomial optimization
by: Averkov, Gennadiy, et al.
Published: (2024)

A solution method for arbitrary polyhedral convex set optimization problems
by: Löhne, Andreas
Published: (2023)

On the convexity for the range set of two quadratic functions
by: Nguyen, Huu-Quang, et al.
Published: (2025)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
by: Ghaffari-Hadigheh, Alireza, et al.
Published: (2022)

Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
by: Papp, Dávid, et al.
Published: (2025)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
by: Sujanani, Arnesh, et al.
Published: (2024)

Stable gradient-adjusted root mean square propagation on least squares problem
by: Li, Runze, et al.
Published: (2024)

Inference for max-linear Bayesian networks with noise
by: Adams, Mark, et al.
Published: (2025)

Further results on the lower bound on reduced Zagreb index of trees
by: Bašić, Milan, et al.
Published: (2026)

Lispchitz modulus of the argmin mapping in convex quadratic optimization
by: Cánovas, María Josefa, et al.
Published: (2025)

Projection-based curve pattern search for black-box optimization over smooth convex sets
by: Jia, Xiaoxi, et al.
Published: (2025)

Distributed accelerated proximal conjugate gradient methods for multi-agent constrained optimization problems
by: Gebrie, Anteneh Getachew
Published: (2023)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
by: Latafat, Puya, et al.
Published: (2023)

On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)

Representation and Regression Problems in Neural Networks: Relaxation, Generalization, and Numerics
by: Liu, Kang, et al.
Published: (2024)

Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity
by: Tran-Dinh, Quoc, et al.
Published: (2025)

Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Rates
by: Tran-Dinh, Quoc, et al.
Published: (2024)

Application and issues in abstract convexity
by: Millán, Reinier Díaz, et al.
Published: (2022)

Exact augmented Lagrangian duality for mixed integer convex optimization
by: Bhardwaj, Avinash, et al.
Published: (2022)

Augmented Lagrangian methods for fully convex composite optimization
by: De Marchi, Alberto, et al.
Published: (2025)

CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization
by: Chen, Yiwen, et al.
Published: (2025)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
by: Nguyen, Vinh
Published: (2025)

Diminished Sombor matrix, spectral radius, and energy of the graphs
by: Movahedi, F.
Published: (2025)