首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 31 毫秒
1.
In this paper,on the basis of making full use of the characteristics of unconstrained generalized geometric programming(GGP),we establish a nonmonotonic trust region algorithm via the conjugate path for solving unconstrained GGP problem.A new type of condensation problem is presented,then a particular conjugate path is constructed for the problem,along which we get the approximate solution of the problem by nonmonotonic trust region algorithm,and further prove that the algorithm has global convergence and quadratic convergence properties.  相似文献   

2.
A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research topics in mathematical programming. In this paper, we discuss a fairly large number of paramet- ric duality results under various generalized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programming problem.  相似文献   

3.
In this paper,a quasidifferentiable programming problem with inequality constraintsis considered. First,a general form of optimality conditions for this problem is glven,which contains the results of Luderer,Kuntz and Scholtes. Next,a new generalized K-T condition is derived. The new optimality condition doesn‘t use Luderer‘s regularity assumption and ita Lagrangian multipliers don‘t depend on the particular elements in the superdifferentials of the object function and constraint functions, Finally,a penalty function for the prohlem is studied. Sufficient conditions of the penalty function attaining a global minimum are obtained.  相似文献   

4.
The alternating direction method of multipliers(ADMM)is a benchmark for solving convex programming problems with separable objective functions and linear constraints.In the literature it has been illustrated as an application of the proximal point algorithm(PPA)to the dual problem of the model under consideration.This paper shows that ADMM can also be regarded as an application of PPA to the primal model with a customized choice of the proximal parameter.This primal illustration of ADMM is thus complemental to its dual illustration in the literature.This PPA revisit on ADMM from the primal perspective also enables us to recover the generalized ADMM proposed by Eckstein and Bertsekas easily.A worst-case O(1/t)convergence rate in ergodic sense is established for a slight extension of Eckstein and Bertsekas’s generalized ADMM.  相似文献   

5.
The authors give the necessary and sufficient conditions for a generalized circle in a Weyl hypersurface to be generalized circle in the enveloping Weyl space. They then obtain the neccessary and sufficient conditions under which a generalized concircular transformation of one Weyl space onto another induces a generalized transformation oil its subspaces. Finally, it is shown that any totally geodesic or totally umbilical hypersurface of a generalized concircularly flat Weyl space is also generalized concircularly flat.  相似文献   

6.
This paper proposes a nonmonotonic backtracking trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems. Using the duality theory of the linear programming and convex theory, the generalized directional derivative of the general multicommodity minimal cost flow problems is derived. The global convergence and superlinear convergence rate of the proposed algorithm are established under some mild conditions.  相似文献   

7.
METRIC GENERALIZED INVERSE OF LINEAR OPERATOR IN BANACH SPACE***   总被引:13,自引:0,他引:13  
The Moore-Penrose metric generalized inverse T of linear operator T in Banach space is systematically investigated in this paper. Unlike the case in Hilbert space, even T is a linear operator in Banach Space, the Moore-Penrose metric generalized inverse T is usually homogeneous and nonlinear in general. By means of the methods of geometry of Banach Space, the necessary and sufficient conditions for existence, continuitv, linearity and minimum property of the Moore-Penrose metric generalized inverse T will be given, and some properties of T will be investigated in this paper.  相似文献   

8.
In this paper, the definition of generalized isochronous center is given in order to study unitedly real isochronous center and linearizability of polynomial differential systems. An algorithm to compute generalized period constants is obtained, which is a good method to find the necessary conditions of generalized isochronous center for any rational resonance ratio. Its two linear recursive formulas are symbolic and easy to realize with computer algebraic system. The function of time-angle difference is introduced to prove the sufficient conditions. As the application, a class of real cubic Kolmogorov system is investigated and the generalized isochronous center conditions of the origin are obtained.  相似文献   

9.
It is well known that the Einstein tensor G for a Riemannian manifold defined by G βα = R βα 1/2 Rδβα , R βα = g βγ R γα where R γα and R are respectively the Ricci tensor and the scalar curvature of the manifold, plays an important part in Einstein's theory of gravitation as well as in proving some theorems in Riemannian geometry. In this work, we first obtain the generalized Einstein tensor for a Weyl manifold. Then, after studying some properties of generalized Einstein tensor, we prove that the conformal invariance of the generalized Einstein tensor implies the conformal invariance of the curvature tensor of the Weyl manifold and conversely. Moreover, we show that such Weyl manifolds admit a one-parameter family of hypersurfaces the orthogonal trajectories of which are geodesics. Finally, a necessary and sufficient condition in order that the generalized circles of a Weyl manifold be preserved by a conformal mapping is stated in terms of generalized Einstein tensors at corresponding points.  相似文献   

10.
On the basis of the formulations of the logarithmic barrier function and the idea of following the path of minimizers for the logarithmic barrier family of problems the so called "centralpath" for linear programming, we propose a new framework of primal-dual infeasible interiorpoint method for linear programming problems. Without the strict convexity of the logarithmic barrier function, we get the following results: (a) if the homotopy parameterμcan not reach to zero,then the feasible set of these programming problems is empty; (b) if the strictly feasible set is nonempty and the solution set is bounded, then for any initial point x, we can obtain a solution of the problems by this method; (c) if the strictly feasible set is nonempty and the solution set is unbounded, then for any initial point x, we can obtain a (?)-solution; and(d) if the strictly feasible set is nonempty and the solution set is empty, then we can get the curve x(μ), which towards to the generalized solutions.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号