A quadratic penalty method for hypergraph matching
نویسندگان
چکیده
منابع مشابه
Quadratic Convergence of a Penalty Method for Valuing American Options∗
The convergence of a penalty method for solving the discrete regularized American option valuation problem is studied. Sufficient conditions are derived which both guarantee convergence of the nonlinear penalty iteration and ensure that the iterates converge monotonically to the solution. These conditions also ensure that the solution of the penalty problem is an approximate solution to the dis...
متن کاملQuadratic Convergence for Valuing American Options Using a Penalty Method
The convergence of a penalty method for solving the discrete regularized American option valuation problem is studied. Sufficient conditions are derived which both guarantee convergence of the nonlinear penalty iteration and ensure that the iterates converge monotonically to the solution. These conditions also ensure that the solution of the penalty problem is an approximate solution to the dis...
متن کاملOn a Hypergraph Matching Problem
Let H = (V,E) be an r-uniform hypergraph and let F ⊂ 2 . A matching M of H is (α,F)perfect if for each F ∈ F , at least α|F | vertices of F are covered by M . Our main result is a theorem giving sufficient conditions for an r-uniform hypergraph to have a (1− ,F)-perfect matching. As a special case of our theorem we obtain the following result. Let K(n, r) denote the complete r-uniform hypergrap...
متن کاملA Quadratic Fuzzy Penalty Method for Solving a Class of Nonlinear Fuzzy Optimization Problems
Some important methods for solving constrained fuzzy optimization problems replace the original problem by a sequence of sub-problems in which the constraints are represented by terms added to the objective function. In this paper, we describe one approach of this type for solving a class of nonlinear fuzzy optimization problems. The fuzzy quadratic penalty method adds a multiple of the square ...
متن کاملAn interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
In this paper, we consider an interior point method for nonlinear semidefinite programming. Yamashita, Yabe and Harada presented a primal-dual interior point method in which a nondifferentiable merit function was used. By using shifted barrier KKT conditions, we propose a differentiable primal-dual merit function within the framework of the line search strategy, and prove the global convergence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2017
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-017-0583-0