Cover Image

A second-order cone representable class of nonconvex quadratic programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dey, Santanu S., Khajavirad, Aida
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tight semidefinite programming relaxations for sparse box-constrained quadratic programs
by: Khajavirad, Aida
Published: (2026)

A polynomial-time solvable class of sparse box-constrained polynomial optimization problems
by: Khajavirad, Aida
Published: (2026)

Inference in higher-order undirected graphical models and binary polynomial optimization
by: Khajavirad, Aida, et al.
Published: (2024)

The circle packing problem: a theoretical comparison of various convexification techniques
by: Khajavirad, Aida
Published: (2024)

Sensitivity analysis for mixed binary quadratic programming
by: Cifuentes, Diego, et al.
Published: (2023)

Asymptotically tight Lagrangian dual of smooth nonconvex problems via improved error bound of Shapley-Folkman Lemma
by: Dey, Santanu S, et al.
Published: (2026)

New reformulations for 0-1 quadratic programming problem using quadratic nonconvex reformulation techniques and valid inequalities
by: Lu, Cheng, et al.
Published: (2026)

Extended formulations for the multilinear polytope of acyclic hypergraphs
by: Del Pia, Alberto, et al.
Published: (2025)

The complete edge relaxation for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2025)

Rank-one Boolean tensor factorization and the multilinear polytope
by: Del Pia, Alberto, et al.
Published: (2022)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
by: Del Pia, Alberto, et al.
Published: (2024)

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2023)

Probabilistic analysis of dual decomposition on two-stage stochastic integer programs
by: Dey, Santanu S., et al.
Published: (2026)

A class of nonconvex semidefinite programming in which every KKT point is globally optimal
by: Nishioka, Akatsuki, et al.
Published: (2025)

On second-order weak sharp minima of general nonconvex set-constrained optimization problems
by: Ma, Xiaoxiao, et al.
Published: (2025)

A second-order sequential optimality condition for nonlinear second-order cone programming problems
by: Fukuda, Ellen H., et al.
Published: (2023)

Smooth hyperbolicity cones are second-order cone representable
by: Scheiderer, Claus
Published: (2025)

Facial structure of copositive and completely positive cones over a second-order cone
by: Nishijima, Mitsuhiro, et al.
Published: (2025)

Finding quadratic underestimators for optimal value functions of nonconvex all-quadratic problems via copositive optimization
by: Gabl, Markus, et al.
Published: (2024)

A deterministic optimization algorithm for nonconvex and combinatorial bi-objective programming
by: Lee, Ye Seol, et al.
Published: (2024)

Improving Full Strong Branching Decisions by Incorporating Additional Information
by: Shah, Prachi, et al.
Published: (2025)

Convexification of a Separable Function over a Polyhedral Ground Set
by: Dey, Santanu S., et al.
Published: (2025)

On the power of linear programming for K-means clustering
by: De Rosa, Antonio, et al.
Published: (2024)

A strong second-order sequential optimality condition for nonlinear programming problems
by: Li, Huimin, et al.
Published: (2025)

Simple linesearch-free first-order methods for nonconvex optimization
by: Yagishita, Shotaro, et al.
Published: (2025)

A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme
by: Wei, Jiazhen, et al.
Published: (2025)

Directional first order approach for a class of bilevel programs
by: Bai, Kuang, et al.
Published: (2026)

An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
by: Hien, Le Thi Khanh, et al.
Published: (2022)

Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
by: Zeng, Liaoyuan, et al.
Published: (2021)

Extreme Strong Branching for QCQPs
by: Dey, Santanu S., et al.
Published: (2025)

On Sparse Canonical Correlation Analysis
by: Li, Yongchun, et al.
Published: (2023)

Non-Monotonicity of Branching Rules with respect to Linear Relaxations
by: Shah, Prachi, et al.
Published: (2024)

Aggregation of Bilinear Bipartite Equality Constraints and its Application to Structural Model Updating Problem
by: Dey, Santanu S, et al.
Published: (2024)

Lagrangian dual with zero duality gap that admits decomposition
by: Cifuentes, Diego, et al.
Published: (2024)

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

Superlinear and quadratic convergence of a stabilized sequential quadratic semidefinite programming method for nonlinear semidefinite programming problems
by: Yamakawa, Yuya
Published: (2022)

An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization
by: Liu, Ruyu, et al.
Published: (2023)

On semidefinite descriptions for convex hulls of quadratic programs
by: Wang, Alex L., et al.
Published: (2024)

Branching with a pre-specified finite list of $k$-sparse split sets for binary MILPs
by: Dey, Santanu S., et al.
Published: (2024)

Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization
by: Bodard, Alexander, et al.
Published: (2025)