Cover Image

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Neira, David E. Bernal, Grossmann, Ignacio E.
Format:	Preprint
Published:	2021
Subjects:	Optimization and Control 90C11, 90C25, 90C26 G.1.6; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
by: Kojima, Masakazu, et al.
Published: (2025)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
by: Namchaisiri, Charles, et al.
Published: (2024)

Asymmetry in the Complexity of the Multi-Commodity Network Pricing Problem
by: Bui, Quang Minh, et al.
Published: (2022)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
by: Arima, Naohiko, et al.
Published: (2023)

Comparative Evaluation of SDP, SOCP, and QC Convex Relaxations for Large-Scale Market-Based AC Optimal Power Flow
by: Keskin, Ata
Published: (2026)

Stochastic convergence of parallel asynchronous adaptive first-order methods
by: Gratton, Serge, et al.
Published: (2026)

Barrier Algorithms for Constrained Non-Convex Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

DC Semidefinite Programming and Cone Constrained DC Optimization: Theory and Local Search Methods
by: Dolgopolik, M. V.
Published: (2021)

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
by: Prakhya, Karthik, et al.
Published: (2026)

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

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

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
by: Huang, Queenie Yingkun, et al.
Published: (2024)

A Safe Approximation Based on Mixed-Integer Optimization for Non-Convex Distributional Robustness Governed by Univariate Indicator Functions
by: Dienstbier, Jana, et al.
Published: (2023)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
by: Gómez-Casares, Ignacio, et al.
Published: (2025)

Enhancing Model Based Derivative Free Optimization using Direct Search
by: Li, Zijun, et al.
Published: (2026)

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

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

Separable QCQPs and Their Exact SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2025)

A simple algorithm for the simple bilevel programming (SBP) problem
by: Dempe, Stephan, et al.
Published: (2025)

A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad, Shampoo and Muo
by: Gratton, S., et al.
Published: (2026)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
by: Lapucci, Matteo, et al.
Published: (2024)

Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems
by: de Roux, Daniel, et al.
Published: (2025)

OPM, a collection of Optimization Problems in Matlab
by: Gratton, Serge, et al.
Published: (2021)

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
by: Yildirim, E. Alper
Published: (2025)

PyEPO: A PyTorch-based End-to-End Predict-then-Optimize Library for Linear and Integer Programming
by: Tang, Bo, et al.
Published: (2022)

First and Second Order Necessary and Sufficient Optimality Conditions of Fritz John Type for Vector Problems over Cones
by: Ivanov, Vsevolod I.
Published: (2024)

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

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
by: Gratton, Serge, et al.
Published: (2024)

Complexity and performance for two classes of noise-tolerant first-order algorithms
by: Gratton, S., et al.
Published: (2022)

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

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
by: Qu, Zheng, et al.
Published: (2023)

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
by: Cheng, Cong-Dian
Published: (2017)

An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
by: Zhang, Na, et al.
Published: (2025)

Pseudoconvex Problems in Operational Decision Systems: Algorithms for Joint Learning and Optimization
by: Li, Zijun, et al.
Published: (2026)

Multiobjective Programming and Weighting Scalar Problem
by: Ivanov, Vsevolod I.
Published: (2025)

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

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation
by: Wang, Jie
Published: (2022)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
by: Guo, Feng, et al.
Published: (2023)

A Unifying Convexification Framework for Chance-Constrained Programs via Bilinear Extended Formulations over a Simplex
by: Davarnia, Danial, et al.
Published: (2025)