Copertina

Duality of Hoffman constants

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Pena, Javier F., Vera, Juan C., Zuluaga, Luis F.
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Optimization and Control 90C05, 90C25, 90C57
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
di: van Treek, Kira, et al.
Pubblicazione: (2025)

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

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

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
di: Chen, Kaihuang, et al.
Pubblicazione: (2025)

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
di: da Silva, Renan F. F., et al.
Pubblicazione: (2023)

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

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

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

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

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
di: Quintero, Rodolfo A., et al.
Pubblicazione: (2024)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
di: He, Jiahuan, et al.
Pubblicazione: (2023)

Fast convergence of Frank-Wolfe algorithms on polytopes
di: Wirth, Elias, et al.
Pubblicazione: (2024)

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

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

Cutting planes for signomial programming
di: Xu, Liding, et al.
Pubblicazione: (2022)

Linear Decision Tree Policies for Integer Linear Programs
di: Guyard, Théo, et al.
Pubblicazione: (2026)

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
di: Singh, Vikram, et al.
Pubblicazione: (2025)

Measure This, Not That: Optimizing the Cost and Model-Based Information Content of Measurements
di: Wang, Jialu, et al.
Pubblicazione: (2024)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
di: Niu, Yi-Shuai, et al.
Pubblicazione: (2018)

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

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

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
di: Tanınmış, Kübra, et al.
Pubblicazione: (2023)

Finding Short Paths on Simple Polytopes
di: Black, Alexander E., et al.
Pubblicazione: (2026)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
di: Takahashi, Shota, et al.
Pubblicazione: (2025)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
di: Song, Yongcun, et al.
Pubblicazione: (2024)

Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
di: Nikolaev, Andrei V., et al.
Pubblicazione: (2022)

Exact Decomposition Branching exploiting Lattice Structures
di: Halbig, Katrin, et al.
Pubblicazione: (2024)

Splitting Algorithms for Distributionally Robust Optimization
di: Briceño-Arias, Luis, et al.
Pubblicazione: (2024)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
di: Bestuzheva, Ksenia, et al.
Pubblicazione: (2022)

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

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem
di: Bencheikh, Ali, et al.
Pubblicazione: (2024)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
di: Chen, Kaihuang, et al.
Pubblicazione: (2025)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
di: Traoré, Cheik, et al.
Pubblicazione: (2025)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
di: Zhang, Rui-Jin, et al.
Pubblicazione: (2025)

HPR-LP: An implementation of an HPR method for solving linear programming
di: Chen, Kaihuang, et al.
Pubblicazione: (2024)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
di: Zhou, Yingxin, et al.
Pubblicazione: (2025)

Equitable Routing--Rethinking the Multiple Traveling Salesman Problem
di: Bhadoriya, Abhay Singh, et al.
Pubblicazione: (2024)

Generalizations of Total Dual Integrality
di: Guenin, Bertrand, et al.
Pubblicazione: (2025)

Global optimization of multivariable functions satisfying the Vanderbei condition
di: Arutyunova, Natalya, et al.
Pubblicazione: (2019)

Steiner Cut Dominants
di: Conforti, Michele, et al.
Pubblicazione: (2022)