Cover Image

A Convexification-based Outer-Approximation Method for Convex and Nonconvex MINLP

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Peng, Zedong, Cao, Kaiyu, Furman, Kevin C., Li, Can, Grossmann, Ignacio E., Neira, David E. Bernal
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

New Outer Approximation Algorithms for Nonsmooth Convex MINLP Problems
by: Wei, Zhou, et al.
Published: (2026)

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

Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization
by: Peng, Zedong, et al.
Published: (2025)

Addressing Discrete Dynamic Optimization via a Logic-Based Discrete-Steepest Descent Algorithm
by: Peng, Zedong, et al.
Published: (2024)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
by: Neira, David E. Bernal, et al.
Published: (2021)

Efficient Convexification of Kolmogorov-Arnold Networks with Polynomial Functional Forms Via a Continuous Graham Scan Approach
by: Li, Tianwei, et al.
Published: (2026)

Logic-Based Discrete-Steepest Descent: A Solution Method for Process Synthesis Generalized Disjunctive Programs
by: Ovalle, Daniel, et al.
Published: (2024)

An Alternating Primal Heuristic for Nonconvex MIQCQP with Dynamic Convexification and Parallel Local Branching
by: Dai, Yongzheng, et al.
Published: (2026)

A Quadratically-Constrained Convex Approximation for the AC Optimal Power Flow
by: Constante-Flores, Gonzalo E., et al.
Published: (2025)

Global Optimization via Quadratic Disjunctive Programming for Water Networks Design with Energy Recovery
by: Tristán, Carolina, et al.
Published: (2024)

Constructing Tight Quadratic Relaxations for Global Optimization: I. Outer-Approximating Twice-Differentiable Convex Functions
by: Strahl, William R., et al.
Published: (2024)

Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2025)

Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity
by: Chen, Lesi, et al.
Published: (2025)

Leveraging Classical and Quantum Computing for Process Systems Engineering Applications: Decomposition Algorithm with Ising Solvers for Efficient Discrete Landscape Exploration
by: Park, Yirang, et al.
Published: (2026)

Exact Hull Reformulation for Quadratically Constrained Generalized Disjunctive Programs
by: Gusev, Sergey, et al.
Published: (2025)

Successive Convexification with Feasibility Guarantee via Augmented Lagrangian for Non-Convex Optimal Control Problems
by: Oguri, Kenshiro
Published: (2023)

Lossless Convexification and Duality
by: Lee, Donghwan
Published: (2021)

Mixed-Integer Reaggregated Hull Reformulation of Special Structured Generalized Linear Disjunctive Programs
by: Lee, Albert Joon, et al.
Published: (2026)

A reformulation-enumeration MINLP algorithm for gas network design
by: Li, Yijiang, et al.
Published: (2023)

Convexification Techniques for Fractional Programs
by: He, Taotao, et al.
Published: (2023)

A computational comparison of handling distance constraints in MINLP
by: Hojny, Christopher, et al.
Published: (2026)

Methods of Nonconvex Optimization
by: Mikhalevich, V. S., et al.
Published: (2024)

MINLP-based hybrid strategy for operating mode selection of TES-backed-up refrigeration systems
by: Bejarano, G., et al.
Published: (2024)

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization
by: Wang, Nuozhou, et al.
Published: (2025)

Parametric Nonconvex Optimization via Convex Surrogates
by: Wang, Renzi, et al.
Published: (2026)

Parabolic Approximation & Relaxation for MINLP
by: Göß, Adrian, et al.
Published: (2024)

A relax-fix-and-exclude algorithm for an MINLP problem with multilinear interpolations
by: Pacheco, Bruno Machado, et al.
Published: (2025)

Convexification of bilinear terms over network polytopes
by: Khademnia, Erfan, et al.
Published: (2023)

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

Quantum Hamiltonian Descent based Augmented Lagrangian Method for Constrained Nonconvex Nonlinear Optimization
by: Li, Mingze, et al.
Published: (2025)

On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation
by: Kwon, Jeongyeol, et al.
Published: (2023)

Intrinsic Successive Convexification: Trajectory Optimization on Smooth Manifolds
by: Kraisler, Spencer, et al.
Published: (2025)

Trajectory Optimization by Successive Pseudospectral Convexification on Riemannian Manifolds
by: Narumi, Tatsuya, et al.
Published: (2025)

On the Convexification of a Class of Mixed-Integer Conic Sets
by: Du, Guxin, et al.
Published: (2025)

On the Convexification of Spectral Sets Induced by Non-Invariant Sets
by: Zhao, Renbo
Published: (2024)

Distributed Discrete-time Dynamic Outer Approximation of the Intersection of Ellipsoids
by: Sebastián, Eduardo, et al.
Published: (2024)

Private and Robust Distributed Nonconvex Optimization via Polynomial Approximation
by: He, Zhiyu, et al.
Published: (2021)

On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization
by: Zhou, Dongruo, et al.
Published: (2018)

Inertial Proximal Difference-of-Convex Algorithm with Convergent Bregman Plug-and-Play for Nonconvex Imaging
by: Chow, Tsz Ching, et al.
Published: (2024)

NonOpt: Nonconvex, Nonsmooth Optimizer
by: Curtis, Frank E., et al.
Published: (2025)