2008•OptimizationRequires access

Global optimality conditions for mixed nonconvex quadratic programs†

Zhiyou Wu, Fang Bai

Abstract

In this article, we present some global optimality conditions for mixed quadratic programming problems. Our approach is based on a L-subdifferential and an associated L-normal cone. Unlike most subdifferentials, the L-subdifferential is formed by functions that are not necessarily linear functions. We derive some sufficient and necessary global optimality conditions for mixed quadratic programs with box constraints and binary constraints.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Mathematics, Subderivative, Quadratic programming, Quadratic equation, Mathematical optimization, Quadratic model, Second-order cone programming, Cone (formal languages)