共查询到20条相似文献,搜索用时 46 毫秒
1.
We generalize Hall's condition for the existence of a perfect matching in a bipartite graph, to balanced hypergraphs.This work was partially supported in part by NSF grants DMI-9424348, DMS-9509581 and ONR grant N00014-89-J-1063. Ajai Kapoor was also supported by a grant from Gruppo Nazionale Delle Riccerche-CNR. Finally, we acknowledge the support of Laboratiore ARTEMIS, Université Joseph Fourier, Grenoble. 相似文献
2.
One perceived deficiency of interior-point methods in comparison to active set methods is their inability to efficiently re-optimize
by solving closely related problems after a warmstart. In this paper, we investigate the use of a primal–dual penalty approach
to overcome this problem. We prove exactness and convergence and show encouraging numerical results on a set of linear and
mixed integer programming problems.
Research of the first author is sponsored by ONR grant N00014-04-1-0145. Research of the second author is supported by NSF
grant DMS-0107450. 相似文献
3.
The paper considers an example of Wächter and Biegler which is shown to converge to a nonstationary point for the standard primal–dual interior-point method for nonlinear programming. The reason for this failure is analyzed and a heuristic resolution is discussed. The paper then characterizes the performance of LOQO, a line-search interior-point code, on a large test set of nonlinear programming problems. Specific types of problems which can cause LOQO to fail are identified.Research of the first and third authors supported by NSF grant DMS-9870317, ONR grant N00014-98-1-0036.Research of the second author supported by NSF grant DMS-9805495. 相似文献
4.
We prove a conjecture of Younger, that for every integern0 there exists an integert0 such that for every digraphG, eitherG hasn vertex-disjoint directed circuits, orG can be made acyclic by deleting at mostt vertices.Research partially supported by DONET ECHM contract CHRXCT930090.Research partially supported by DIMACS, by NSF grant DMS-9401981 and by ONR grant N00014-92-J-1965, and partially performed under a consulting agreement with Bellcore.Research partially supported by DIMACS, by Université de Paris VI, by NSF grant DMS-9303761 and by ONR grant N00014-93-1-0325, and partially performed under a consulting agreement with Bellcore. 相似文献
5.
In this paper, we investigate the use of an exact primal-dual penalty approach within the framework of an interior-point method
for nonconvex nonlinear programming. This approach provides regularization and relaxation, which can aid in solving ill-behaved
problems and in warmstarting the algorithm. We present details of our implementation within the loqo algorithm and provide extensive numerical results on the CUTEr test set and on warmstarting in the context of quadratic,
nonlinear, mixed integer nonlinear, and goal programming.
Research of the first author is sponsored by ONR grant N00014-04-1-0145. Research of the second author is supported by NSF
grant DMS-0107450. 相似文献
6.
A reformulation of the planetary geostrophic equations (PGEs) with the inviscid balance equation is proposed and the existence of global weak solutions is established, provided that the mechanical force satisfies an integral constraint. There is only one prognostic equation for the temperature field, and the velocity field is statically determined by the planetary geostrophic balance combined with the incompressibility condition. Furthermore, the velocity profile can be accurately represented as a function of the temperature gradient. In particular, the vertical velocity depends only on the first-order derivative of the temperature. As a result, the bound for the L∞ (0, t 1 ; L 2) ∩ L 2 (0, t 1 ; H 1) norm of the temperature field is sufficient to show the existence of the weak solution. 相似文献
7.
Persistent homology captures the topology of a filtration—a one-parameter family of increasing spaces—in terms of a complete
discrete invariant. This invariant is a multiset of intervals that denote the lifetimes of the topological entities within
the filtration. In many applications of topology, we need to study a multifiltration: a family of spaces parameterized along
multiple geometric dimensions. In this paper, we show that no similar complete discrete invariant exists for multidimensional
persistence. Instead, we propose the rank invariant, a discrete invariant for the robust estimation of Betti numbers in a multifiltration, and prove its completeness in one
dimension.
The first author was partially supported by NSF under grant DMS-0354543. The second author was partially supported by DARPA
under grant HR 0011-06-1-0038 and by ONR under grant N 00014-08-1-0908. Both authors were partially supported by DARPA under
grant HR 0011-05-1-0007. 相似文献
8.
Based on two-grid discretizations, some local and parallel finite element algorithms for the Stokes problem are proposed and
analyzed in this paper. These algorithms are motivated by the observation that for a solution to the Stokes problem, low frequency
components can be approximated well by a relatively coarse grid and high frequency components can be computed on a fine grid
by some local and parallel procedure. One technical tool for the analysis is some local a priori estimates that are also obtained
in this paper for the finite element solutions on general shape-regular grids.
Y. He was partially subsidized by the NSF of China 10671154 and the National Basic Research Program under the grant 2005CB321703;
A. Zhou was partially supported by the National Science Foundation of China under the grant 10425105 and the National Basic
Research Program under the grant 2005CB321704; J. Li was partially supported by the NSF of China under the grant 10701001.
J. Xu was partially supported by Alexander von Humboldt Research Award for Senior US Scientists, NSF DMS-0609727 and NSFC-10528102. 相似文献
9.
In this paper we study robust convex quadratically constrained programs, a subset of the class of robust convex programs introduced by Ben-Tal and Nemirovski [4]. In contrast to [4], where it is shown that such robust problems can be formulated as semidefinite programs, our focus in this paper is to identify uncertainty sets that allow this class of problems to be formulated as second-order cone programs (SOCP). We propose three classes of uncertainty sets for which the robust problem can be reformulated as an explicit SOCP and present examples where these classes of uncertainty sets are natural.
Research partially supported by DOE grant GE-FG01-92ER-25126, NSF grants DMS-94-14438, CDA-97-26385, DMS-01-04282 and ONR grant N000140310514.Research partially supported by NSF grants CCR-00-09972, DMS-01-04282 and ONR grant N000140310514. 相似文献
10.
On multilevel iterative methods for optimization problems 总被引:2,自引:0,他引:2
This paper is concerned with multilevel iterative methods which combine a descent scheme with a hierarchy of auxiliary problems in lower dimensional subspaces. The construction of auxiliary problems as well as applications to elasto-plastic model and linear programming are described. The auxiliary problem for the dual of a perturbed linear program is interpreted as a dual of perturbed aggregated linear program. Coercivity of the objective function over the feasible set is sufficient for the boundedness of the iterates. Equivalents of this condition are presented in special cases.Supported by NSF under grant DMS-8704169, AFOSR under grant 86-0126, and ONR under Contract N00014-83-K-0104. Consulting for American Airlines Decision Technologies, MD 2C55, P.O. Box 619616, DFW, TX 75261-9616, USA.Supported by NSF under grant DMS-8704169 and AFOSR under grant 86-0126. 相似文献
11.
We describe a cutting plane algorithm for solving combinatorial optimization problems. The primal projective standard-form variant of Karmarkar's algorithm for linear programming is applied to the duals of a sequence of linear programming relaxations of the combinatorial optimization problem.Computational facilities provided by the Cornell Computational Optimization Project supported by NSF Grant DMS-8706133 and by the Cornell National Supercomputer Facility. The Cornell National Supercomputer Facility is a resource of the Center for Theory and Simulation in Science and Engineering at Cornell Unversity, which is funded in part by the National Science Foundation, New York State, and the IBM Corporation. The research of both authors was partially supported by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University.Research partially supported by ONR Grant N00014-90-J-1714.Research partially supported by NSF Grant ECS-8602534 and by ONR Contract N00014-87-K-0212. 相似文献
12.
In this paper we study a sub-class of compact Ricci flat manifolds from certain standard constructions.
Research supported in part by NSF grant #DMS84-09447 and ONR contract #N-00014-85-K-0367. 相似文献
13.
We propose a method for finding analytic center of a convex feasible region whose boundaries are defined by quadratic functions. The algorithm starts from an arbitrary initial point and approaches to the desired center by simultaneously reducing infeasibility or slackness of all constraints. A partial Newton step is taken at each iteration.Research supported in part by the ONR under grant N00014-87-K-0214 and by the NSF under grant CCR-8810107.Research supported in part by the NSF under grant ECS-8721709. 相似文献
14.
Maria Chudnovsky Gérard Cornuéjols Xinming Liu? Paul Seymour? Kristina Vu?kovi?? 《Combinatorica》2005,25(2):143-186
A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. In this paper we give an algorithm to test if a graph G is Berge, with running time O(|V (G)|9). This is independent of the recent proof of the strong perfect graph conjecture.* Currently this author is a Clay Mathematics Institute Research Fellow.** Supported by NSF grant DMI-0352885 and ONR grant N00014-97-1-0196. Supported by ONR grant N00014-01-1-0608, and NSF grant DMS-0070912. Supported by EPSRC grant GR/R35629/01. 相似文献
15.
Pierre Bonami Gérard Cornuéjols Andrea Lodi François Margot 《Mathematical Programming》2009,119(2):331-352
We present an algorithm for finding a feasible solution to a convex mixed integer nonlinear program. This algorithm, called
Feasibility Pump, alternates between solving nonlinear programs and mixed integer linear programs. We also discuss how the
algorithm can be iterated so as to improve the first solution it finds, as well as its integration within an outer approximation
scheme. We report computational results.
P. Bonami is supported in part by a grant from IBM and by ANR grant BLAN06-1-138894.
G. Cornuéjols is supported in part by NSF grant CMMI-0653419, ANR grant BLAN06-1-138894 and ONR grant N00014-03-1-0188.
Part of this research was carried out when Andrea Lodi was Herman Goldstine Fellow of the IBM T.J. Watson Research Center
whose support is gratefully acknowledged.
F. Margot is supported in part by a grant from IBM and by ONR grant N00014-03-1-0188. 相似文献
16.
In this paper, we address the problem of the existence of superconvergence points of approximate solutions, obtained from
the Generalized Finite Element Method (GFEM), of a Neumann elliptic boundary value problem. GFEM is a Galerkin method that
uses non-polynomial shape functions, and was developed in (Babuška et al. in SIAM J Numer Anal 31, 945–981, 1994; Babuška
et al. in Int J Numer Meth Eng 40, 727–758, 1997; Melenk and Babuška in Comput Methods Appl Mech Eng 139, 289–314, 1996).
In particular, we show that the superconvergence points for the gradient of the approximate solution are the zeros of a system
of non-linear equations; this system does not depend on the solution of the boundary value problem. For approximate solutions
with second derivatives, we have also characterized the superconvergence points of the second derivatives of the approximate
solution as the roots of a system of non-linear equations. We note that smooth generalized finite element approximation is
easy to construct.
I. Babuška’s research was partially supported by NSF Grant # DMS-0341982 and ONR Grant # N00014-99-1-0724.
U. Banerjee’s research was partially supported by NSF Grant # DMS-0341899.
J. E. Osborn’s research was supported by NSF Grant # DMS-0341982. 相似文献
17.
A relaxed version of Karmarkar's method is developed. This method is proved to have the same polynomial time complexity as Karmarkar's method and its efficient implementation using inexact projections is discussed. Computational results obtained using a preliminary implementation of the method are presented which indicate that the method is practicable.This research was supported in part by NSF Grants CDR 84-21402 and DMS-85-12277 and ONR Contract N00014-87-K-0214. 相似文献
18.
Ellipsoids that contain all optimal dual slack solutions and those that contain all optimal primal solutions and that are independent of the algorithm used are derived. Based upon these ellipsoids, two criteria each for detecting optimal basic and nonbasic variables prior to optimality in interior-point methods are obtained. Using these results, we then derive a sufficient condition for a linear program to be feasible.This research was supported in part by NSF Grant DMS-85-12277, DMS-91-06195, CDR-84-21402 and ONR Contract N00014-87-K-0214. 相似文献
19.
An efficient cost scaling algorithm for the assignment problem 总被引:1,自引:0,他引:1
The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow problems. In this paper we apply the method to the assignment problem and investigate implementations of the method that take advantage of assignment's special structure. The results show that the method is very promising for practical use.This author's research was supported in part by ONR Young Investigator Award N00014-91-J-1855, NSF Presidential Young Investigator Grant CCR-8858097 with matching funds from AT&T, DEC and 3M, and a grant from the Powell Foundation.This author's research was supported by the above-mentioned ONR and NSF grants. 相似文献
20.
The paper presents necessary and sufficient conditions for the absolute continuity of measures generated by infinite-dimensional martingale problems. This result is applied to the study of the existence and uniqueness of weak solutions to nonlinear parabolic SPDE's. The paper also addresses the problem of stochastic integration with respect to a martingale in a quasi-complete locally convex topological vector space.This work was partially supported by NSF Grant # DMS-9002997 and ONR Grant # N00014-91-J-1526. 相似文献