The aim of this paper is to propose a solution algorithm for a particular class of rank-two nonconvex programs having a polyhedral feasible region. The algorithm is based on the so-called ‘‘optimal level solutions’’ method. Various global optimality conditions are discussed and implemented in order to improve the efficiency of the algorithm
AbstractThis paper presents a method for obtaining closed form solutions to serial and nonserial dyn...
This paper is concerned with the study of an arbitrary polynomial optimization via a convex relaxati...
Computational methods are considered for finding a point that satisfies the second-order necessary c...
AbstractThe aim of this paper is to propose a solution algorithm for a particular class of rank-two ...
The aim of this paper is to propose a solution algorithm for a particular class of rank-two nonconve...
In this paper a solution algorithm for a class of rank-two nonconvex programs having a polyhedral fe...
Low rank problems are nonlinear minimization problems in which the objective function, by means of a...
The aim of this paper is two-fold. First, the so-called ‘optimal level solutions’ method is describe...
In this paper a method to solve two different classes of low-rank gener- alized linear programs havi...
The aim of this paper is to show how a wide class of generalized quadratic programs can be solved, i...
In this paper, we focus on a special nonconvex quadratic program whose feasible set is a structured ...
Low rank problems are nothing but nonlinear minimization problems over polyhedrons where a linear tr...
Despite recent advances in optimization research and computing technology, deriving global optimal s...
We reformulate a (indefinite) quadratic program (QP) as a mixed-integer linear programming (MILP) pr...
In this paper, we present an effective algorithm for globally solving quadratic programs with quadra...
AbstractThis paper presents a method for obtaining closed form solutions to serial and nonserial dyn...
This paper is concerned with the study of an arbitrary polynomial optimization via a convex relaxati...
Computational methods are considered for finding a point that satisfies the second-order necessary c...
AbstractThe aim of this paper is to propose a solution algorithm for a particular class of rank-two ...
The aim of this paper is to propose a solution algorithm for a particular class of rank-two nonconve...
In this paper a solution algorithm for a class of rank-two nonconvex programs having a polyhedral fe...
Low rank problems are nonlinear minimization problems in which the objective function, by means of a...
The aim of this paper is two-fold. First, the so-called ‘optimal level solutions’ method is describe...
In this paper a method to solve two different classes of low-rank gener- alized linear programs havi...
The aim of this paper is to show how a wide class of generalized quadratic programs can be solved, i...
In this paper, we focus on a special nonconvex quadratic program whose feasible set is a structured ...
Low rank problems are nothing but nonlinear minimization problems over polyhedrons where a linear tr...
Despite recent advances in optimization research and computing technology, deriving global optimal s...
We reformulate a (indefinite) quadratic program (QP) as a mixed-integer linear programming (MILP) pr...
In this paper, we present an effective algorithm for globally solving quadratic programs with quadra...
AbstractThis paper presents a method for obtaining closed form solutions to serial and nonserial dyn...
This paper is concerned with the study of an arbitrary polynomial optimization via a convex relaxati...
Computational methods are considered for finding a point that satisfies the second-order necessary c...
DOI
Add to ORKG