In many applications, it makes sense to solve the least square problems with nonnegative constraints. In this article, we present a new multiplicative iteration that monotonically decreases the value of the nonnegative quadratic programming (NNQP) objective function. This new algorithm has a simple closed form and is easily implemented on a parallel machine. We prove the global convergence of the new algorithm and apply it to solving image super-resolution and color image labelling problems. The experimental results demonstrate the effectiveness and broad applicability of the new algorithm. Copyright c © 2014 John Wile
Many computer vision problems can be formulated as binary quadratic programs (BQPs). Two classic rel...
We reformulate a (indefinite) quadratic program (QP) as a mixed-integer linear programming (MILP) pr...
AbstractIn this paper, a new feasible sequential quadratic programming (FSQP) algorithm is proposed ...
Many problems in neural computation and statistical learning involve optimizations with nonnegativit...
This paper proposes an active set method based on nonnegative least squares (NNLS) to solve strictly...
International audienceThe problem of minimizing a quadratic form over a ball centered at the origin ...
Model Predictive Control (MPC) is one of the most successful techniques adopted in industry to contr...
We present a new algorithm to solve linear programming problems with finite lower and upper bounds....
Abstract To globally solve a nonconvex quadratic programming problem, this paper presents an acceler...
We discuss a new simple method to solve linear programming (LP) problems, based on the so called dua...
We derive multiplicative updates for solving the nonnegative quadratic programming problem in suppor...
none3We propose an iterative method that solves constrained linear least-squares problems by formula...
An algorithm for nonlinear programming problems with equality constraints is presented which is glob...
A simple scheme is proposed for handling nonlinear equality constraints in the context of a previous...
AbstractIn this paper, we present a new sequential quadratically constrained quadratic programming (...
Many computer vision problems can be formulated as binary quadratic programs (BQPs). Two classic rel...
We reformulate a (indefinite) quadratic program (QP) as a mixed-integer linear programming (MILP) pr...
AbstractIn this paper, a new feasible sequential quadratic programming (FSQP) algorithm is proposed ...
Many problems in neural computation and statistical learning involve optimizations with nonnegativit...
This paper proposes an active set method based on nonnegative least squares (NNLS) to solve strictly...
International audienceThe problem of minimizing a quadratic form over a ball centered at the origin ...
Model Predictive Control (MPC) is one of the most successful techniques adopted in industry to contr...
We present a new algorithm to solve linear programming problems with finite lower and upper bounds....
Abstract To globally solve a nonconvex quadratic programming problem, this paper presents an acceler...
We discuss a new simple method to solve linear programming (LP) problems, based on the so called dua...
We derive multiplicative updates for solving the nonnegative quadratic programming problem in suppor...
none3We propose an iterative method that solves constrained linear least-squares problems by formula...
An algorithm for nonlinear programming problems with equality constraints is presented which is glob...
A simple scheme is proposed for handling nonlinear equality constraints in the context of a previous...
AbstractIn this paper, we present a new sequential quadratically constrained quadratic programming (...
Many computer vision problems can be formulated as binary quadratic programs (BQPs). Two classic rel...
We reformulate a (indefinite) quadratic program (QP) as a mixed-integer linear programming (MILP) pr...
AbstractIn this paper, a new feasible sequential quadratic programming (FSQP) algorithm is proposed ...