Solution of dynamic optimization problems by successive quadratic programming and orthogonal collocatio
An overview of global methods for dynamic optimization and mixed-integer dynamic optimization (MIDO)...
This thesis comprises three parts. The first part discusses the Gravitational method for Linear Prog...
The idea of solving the definite linear complementarity problem by successive overrelaxation was ori...
Abstract: "Recently, strategies have been developed to solve dynamic simulation and optimization pro...
AbstractThis paper presents a method for obtaining closed form solutions to serial and nonserial dyn...
This paper presents the novel deterministic dynamic programming approach for solving optimization pr...
This thesis presents new mathematical algorithms for the numerical solution of a mathematical probl...
Canonical duality theory, Quadratic programming, Integer programming, NP-hard problems, Global optim...
In this thesis sensitivity analysis for quadratic optimization problems is stud-ied. In sensitivity ...
An algorithm is described for determining the optimal solution of parametric linear and quadratic pr...
Sequential (or Successive) Quadratic Programming (SQP) is a technique for the solution of Nonlinear ...
By perturbing a linear program to a quadratic program it is possible to solve the latter in its dual...
We analyze sequential quadratic programming (SQP) methods to solve nonlinear constrained optimizatio...
In this paper we study the problem of parametric minimization of convex piecewise quadratic function...
Optimization is the process of maximizing or minimizing the objective function which satisfies the g...
An overview of global methods for dynamic optimization and mixed-integer dynamic optimization (MIDO)...
This thesis comprises three parts. The first part discusses the Gravitational method for Linear Prog...
The idea of solving the definite linear complementarity problem by successive overrelaxation was ori...
Abstract: "Recently, strategies have been developed to solve dynamic simulation and optimization pro...
AbstractThis paper presents a method for obtaining closed form solutions to serial and nonserial dyn...
This paper presents the novel deterministic dynamic programming approach for solving optimization pr...
This thesis presents new mathematical algorithms for the numerical solution of a mathematical probl...
Canonical duality theory, Quadratic programming, Integer programming, NP-hard problems, Global optim...
In this thesis sensitivity analysis for quadratic optimization problems is stud-ied. In sensitivity ...
An algorithm is described for determining the optimal solution of parametric linear and quadratic pr...
Sequential (or Successive) Quadratic Programming (SQP) is a technique for the solution of Nonlinear ...
By perturbing a linear program to a quadratic program it is possible to solve the latter in its dual...
We analyze sequential quadratic programming (SQP) methods to solve nonlinear constrained optimizatio...
In this paper we study the problem of parametric minimization of convex piecewise quadratic function...
Optimization is the process of maximizing or minimizing the objective function which satisfies the g...
An overview of global methods for dynamic optimization and mixed-integer dynamic optimization (MIDO)...
This thesis comprises three parts. The first part discusses the Gravitational method for Linear Prog...
The idea of solving the definite linear complementarity problem by successive overrelaxation was ori...
DOI
Add to ORKG