Imagen de Portada

Cutting planes for signomial programming

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Xu, Liding, D'Ambrosio, Claudia, Liberti, Leo, Vanier, Sonia Haddad
Formato:	Preprint
Publicado:	2022
Materias:	Optimization and Control 90C10, 90C26, 90C57
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

Beyond binarity: Semidefinite programming for ternary quadratic problems
por: de Meijer, Frank, et al.
Publicado: (2026)

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

Introducing Clause Cuts: Strong No-Good Cuts for MaxSAT Problems in Mixed Integer Linear Programming
por: Engelhardt, Max, et al.
Publicado: (2025)

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

Generalizations of Total Dual Integrality
por: Guenin, Bertrand, et al.
Publicado: (2025)

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

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
por: Göß, Adrian, et al.
Publicado: (2024)

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

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
por: Marumo, Hiroki, et al.
Publicado: (2024)

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

A minimal face constant rank constraint qualification for reducible conic programming
por: Andreani, Roberto, et al.
Publicado: (2023)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
por: Arima, Naohiko, et al.
Publicado: (2024)

On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
por: Nishioka, Akatsuki, et al.
Publicado: (2023)

Minimizing and Maximizing the Shannon Entropy for Fixed Marginals
por: Franke, Paula, et al.
Publicado: (2025)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
por: Namchaisiri, Charles, et al.
Publicado: (2024)

On stability of the Scholtes regularization for mathematical programs with complementarity constraints
por: Shikhman, Vladimir, et al.
Publicado: (2025)

Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset
por: Yuan, Qilong
Publicado: (2025)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
por: Monteiro, Renato D. C., et al.
Publicado: (2024)

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

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
por: Aguirre, Jacob M., et al.
Publicado: (2025)

Competing for the most profitable tour: The orienteering interdiction game
por: Álvarez-Miranda, Eduardo, et al.
Publicado: (2024)

Duality of Hoffman constants
por: Pena, Javier F., et al.
Publicado: (2023)

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

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
por: Jung, Woosuk L., et al.
Publicado: (2023)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
por: Dahl, Simeon vom, et al.
Publicado: (2026)

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

A Surrogate Value Function Formulation for Bilevel Optimization
por: Xu, Mengwei, et al.
Publicado: (2025)

Implied Integrality in Mixed-Integer Optimization
por: van der Hulst, Rolf, et al.
Publicado: (2025)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
por: McRae, Andrew D., et al.
Publicado: (2023)

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
por: Del Pia, Alberto
Publicado: (2023)

An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
por: Fujii, Koichi, et al.
Publicado: (2023)

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

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

An Extended ADMM for 3-Block Nonconvex Nonseparable Problems with Applications
por: Liu, Zekun
Publicado: (2024)

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

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

Depth-first directional search for nonconvex optimization
por: Zhang, Yuxuan, et al.
Publicado: (2024)