SIAMJO
2008
13 years 11 months ago
2008
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
SIAMJO
2008
13 years 11 months ago
2008
We develop in this article a geometric approach to duality in Multiple Objective Linear Programming. This approach is based on a very old idea, the duality of polytopes, which can...
SIAMJO
2008
13 years 11 months ago
2008
SIAMJO
2008
13 years 11 months ago
2008
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
SIAMJO
2008
13 years 11 months ago
2008
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
SIAMJO
2008
13 years 11 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
SIAMJO
2008
13 years 11 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
SIAMJO
2008
13 years 11 months ago
2008
In this paper, we consider the Lagrangian dual problem of a class of convex optimization problems. We first discuss the semismoothness of the Lagrangian-dual function . This prope...
SIAMJO
2008
13 years 11 months ago
2008
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
SIAMJO
2008
13 years 11 months ago
2008
A class of trust-region methods is presented for solving unconstrained nonlinear and possibly nonconvex discretized optimization problems, like those arising in systems governed by...