YI ZHANG, LIWEI ZHANG, JIA WU, JIANZHONG ZHANG, A PERTURBATION APPROACH FOR AN INVERSE QUADRATIC PROGRAMMING PROBLEM OVER SECOND-ORDER CONES, Mathematics of Computation, Vol. 84, No. 291 (JANUARY 2015 ...

The DATA= data set enables you to specify data shared by all functions involved in a least squares problem. The INQUAD= data set contains the arrays appearing in a quadratic programming problem. The ...

This paper is concerned with the solution of linearly constrained zero-one quadratic programming problems. Problems of this kind arise in numerous economic, location decision, and strategic planning ...

1. Introduction Discrete optimization problems have ubiquitous applications in various fields and, in particular, many NP-hard combinatorial optimization problems can be mapped to a quadratic Ising ...

The two quadratic programming schemes of the left and right arms are then integrated into a standard quadratic programming problem constrained by an equality constraint and a bound constraint. As a ...

This paper formulates the mask optimization problem as a 0-1 convex Quadratically Constrained Quadratic Programming (0-1 QCQP) problem, aiming to maximize tolerance under fidelity constraints. We ...

Primal-dual hybrid gradient (PDHG) is a first-order method for saddle-point problems and convex programming introduced by Chambolle and Pock. Recently, Applegate et al.\ analyzed the behavior of PDHG ...

In advanced optical lithography, it is critical to obtain a mask with high fidelity to a target pattern and strong tolerance to process variation within a short time. This paper formulates the mask ...