|
1-10 of 20 reviews |
Date Reviewed | |
|
On the computational complexity of membership problems for the completely positive cone and its dual Dickinson P., Gijben L. Computational Optimization and Applications 57(2): 403-415, 2014. Type: Article
All kinds of combinatorial optimization problems can be formulated in terms of matrices with nonnegative entries, and can therefore be tackled using copositive programming. A matrix is copositive when it remains nonnegative under conju...
|
May 7 2014 |
|
|
Approximation of low rank solutions for linear quadratic control of partial differential equations Morris K., Navasca C. Computational Optimization and Applications 46(1): 93-111, 2010. Type: Article
The authors discuss an approximation of a linear quadratic control problem. The objective function is quadratic, with the state variables satisfying an ordinary or partial differential equation, and the control is weighted. The optimal...
|
Jul 26 2010 |
|
|
Inexact constraint preconditioners for linear systems arising in interior point methods Bergamaschi L., Gondzio J., Venturin M., Zilli G. Computational Optimization and Applications 36(2-3): 137-147, 2007. Type: Article
This paper addresses sparsity in preconditioners for the solution of linear systems arising in the iterations of interior point methods. The systems are symmetric with a two-by-two block structure, where the upper left block is the Hes...
|
Sep 21 2007 |
|
|
Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems Yang X., Zhang J. Computational Optimization and Applications 36(1): 55-66, 2007. Type: Article
Given a set of numbers a = {a1, a2, ..., an}, the solution of an inverse sorting problem is another set of...
|
Aug 1 2007 |
|
|
Multiobjective search algorithm with subdivision technique Jahn J. Computational Optimization and Applications 35(2): 161-175, 2006. Type: Article
Constrained optimization refers to minimizing (or maximizing) an objective function under constraints based on possible values of the independent variable. In a practical constrained optimization problem, there can be multiple independ...
|
May 11 2007 |
|
|
Optimizing preventive maintenance models Bartholomew-Biggs M., Christianson B., Zuo M. Computational Optimization and Applications 35(2): 261-279, 2006. Type: Article
General numerical approaches for the optimal scheduling of preventative maintenance are developed in this paper. The approaches are more adaptable to complex problems than earlier analytic work, and consequently have the potential for ...
|
Mar 21 2007 |
|
|
A new gradient method with an optimal stepsize property Dai Y., Yang X. Computational Optimization and Applications 33(1): 73-88, 2006. Type: Article
The numerical treatment of large linear systems of equations is a major field in computational mathematics. There are two classes of methods: direct methods, which deliver the solution vector after a finite number of arithmetic operati...
|
Oct 31 2006 |
|
|
A projected gradient method for vector optimization problems Drummond L., Iusem A. Computational Optimization and Applications 28(1): 5-29, 2004. Type: Article
Multi-objective optimization has long been an important research topic in both the academic and industrial sectors, and it has many real-world applications. A significant extension is constrained vector-valued optimization, which corre...
|
Sep 7 2005 |
|
|
Preconditioning indefinite systems in interior point methods for optimization Bergamaschi L., Gondzio J., Zilli G. Computational Optimization and Applications 28(2): 149-171, 2004. Type: Article
Sparse symmetric indefinite systems of equations arise in the solution of least squares problems in control applications, and in the solution of Stokes flow problems. For modest-sized problems, direct methods, in the form of sparse sym...
|
Aug 11 2005 |
|
|
Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination Dostál Z., Schöberl J. Computational Optimization and Applications 30(1): 23-43, 2005. Type: Article
The application of finite element methods to the solution of many variational inequalities leads to the minimization of a quadratic function of a large number of variables with bound constraints. Unconstrained problems of this size are...
|
Aug 2 2005 |
|
|
|
|
|
|
|
|