- Chinese︱Feedback︱Save this page
Get RSS feed
Check out RSS, or use RSS reader to subscribe this item 
Confirmation
Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
- Login︱Register
|
|
|
 |
|
||
| There are 49 papers published in subject: > since this site started. | |||
| Results per page: | 49 Total, 5 Pages | << First < Previous 2 3 4 5 |
| Select Subject |
| Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
 |
| 1. Homotopy Method for Constrained Sequential Max-min Problem With a bounded feasible field | |||
| Liu Qinghuai,Wang Xiuyu,Tan Jiawei | |||
Mathematics 11 February 2009
|
|||
| Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
| Abstract:For solving the constrained sequential max-min problem(CSMMP).We construced twice aggregate constraint shifting function with a parameter and a combined homotopy equation, under the conditions of the feasible set bounded connected and the regularity of boundary. We proved the convergence of a smooth homotopy path of the problem . Numerical examples showed that this method is feasible and effective. | |||
| TO cite this article:Liu Qinghuai,Wang Xiuyu,Tan Jiawei. Homotopy Method for Constrained Sequential Max-min Problem With a bounded feasible field[OL].[11 February 2009] http://en.paper.edu.cn/en_releasepaper/content/28789 | |||
| 2. A Constraint Shifting Combined Homotopy Method For Solving Nonlinear Nonconvex Programming | |||
| Wang Xiuyu,Jiang Xingwu,Liu Qinghuai | |||
| Mathematics 04 February 2009
|
|||
| Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
| Abstract:For solving nonlinear nonconvex programming problem,we construct constraint shifting functios with a parameter and a combined homotopy equation. We just need the feasible filed be bounded connected and the regularity of boundary.The convergence of a smooth homotopy path that from any interior point or any infeasible interior point to a solution of the problem is proved.Numerical examples conclued that this method is feasible and effective. | |||
| TO cite this article:Wang Xiuyu,Jiang Xingwu,Liu Qinghuai. A Constraint Shifting Combined Homotopy Method For Solving Nonlinear Nonconvex Programming[OL].[ 4 February 2009] http://en.paper.edu.cn/en_releasepaper/content/28389 | |||
| 3. A Aggregate Constraint Shifting Combined Homotopy Method | |||
| Liu Qinghuai,Wang Xiuyu,Jiang Xingwu | |||
Mathematics 16 January 2009
|
|||
| Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
| Abstract: For solving nonlinear nonconvex programming problem with a convex function. We construct aggregate constraint shifting function with a parameter and a combined homotopy equation under the conditions of the feasible set bounded connected and the regularity of boundary. Convergence of a smooth homotopy path that from any interior point or any infeasible interior point to a solution of the problem is prove. Numerical examples concluded that this method is feasible and effective. | |||
| TO cite this article:Liu Qinghuai,Wang Xiuyu,Jiang Xingwu. A Aggregate Constraint Shifting Combined Homotopy Method [OL].[16 January 2009] http://en.paper.edu.cn/en_releasepaper/content/28010 | |||
| 4. Browder-Tikhonov Regularization for a Class of Evolution Second Order Hemivariational Inequalities | |||
| Yi-bin Xiao,Nan-jing Huang | |||
| Mathematics 04 December 2008 | |||
| Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
| Abstract:In this paper, we consider a class of evolution second order hemivariational inequalities with non-coercive operators which are assumed to be known approximately. Using the so-called Browder-Tikhonov regularization method, we prove that the regularized evolution hemivariational inequality problem is solvable. We construct a sequence based on the solvability of the regularized evolution hemivariational inequality problem and show that every weak cluster of this sequence is a solution for the evolution second order hemivariational inequality. | |||
| TO cite this article:Yi-bin Xiao,Nan-jing Huang. Browder-Tikhonov Regularization for a Class of Evolution Second Order Hemivariational Inequalities[OL].[ 4 December 2008] http://en.paper.edu.cn/en_releasepaper/content/26332 | |||
| 5. Solution of a Class of Minimal Surface Problem with Obstacle | |||
| Liu Kefei,Li Shangzhi,Wang Min | |||
Mathematics 29 August 2008
|
|||
| Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
| Abstract:Plateau’s problem is to determine the surface with minimal area that lies above an obstacle with given boundary conditions. In this paper, a special example of this class of the problem is given and solved with the linear finite element method. First, we triangulate the domain of definition, and transform the linear finite element approximation into a constrained nonlinear optimization problem. Then we introduce a simple and efficient method, named sequential quadratic programming, for solving the constrained nonlinear optimization problem. The sequential quadratic programming is implemented by the fmincon function in the optimization toolbox of MATLAB. Also, we discuss the relations between the number of grids and the computing time as well as the precision of the result. | |||
| TO cite this article:Liu Kefei,Li Shangzhi,Wang Min. Solution of a Class of Minimal Surface Problem with Obstacle[OL].[29 August 2008] http://en.paper.edu.cn/en_releasepaper/content/23631 | |||
| 6. An unify version of Cauchy-Schwarz and Wielandt inequalities | |||
| Yan Zizong | |||
| Mathematics 02 January 2007
|
|||
| Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
| Abstract:Let $A$ be an $n\\\\times n$ positive Hermitian matrix with $n$ eigenvalues satisfying $\\\\lambda_1\\\\geq\\\\lambda_2\\\\geq\\\\cdots\\\\geq\\\\lambda_n$ and $x$ and $y$ be $n\\\\times 1$ two vectors with the angle $\\\\psi$. This paper prove the the following inequality \\\\[(x^*Ay)^2\\\\leq \\\\min\\\\limits_{i,j}\\\\begin{pmatrix} \\\\frac{\\\\lambda_i\\\\cos^2\\\\frac{\\\\psi}{2}-\\\\lambda_j\\\\sin^2\\\\frac{\\\\psi}{2}}{\\\\lambda_i\\\\cos^2\\\\frac{\\\\psi}{2}+ \\\\lambda_j\\\\sin^2\\\\frac{\\\\psi}{2}}\\\\end{pmatrix}^2(x^*Ax)(y^*Ay).\\\\] It is an unify version of Cauchy-Schwarz and Wielandt inequalities. | |||
| TO cite this article:Yan Zizong. An unify version of Cauchy-Schwarz and Wielandt inequalities[OL].[ 2 January 2007] http://en.paper.edu.cn/en_releasepaper/content/10556 | |||
| 7. A Two Term PRP Based Descent Method | |||
| Cheng Wanyou ,Li Donghui | |||
| Mathematics 15 December 2006 | |||
| Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
| Abstract:In this paper, by the use of the project of the PRP (Polak-Ribi秂re-Polyak) conjugate gradient direction, we develop a PRP based descent method for solving unconstrained optimization problem. The method provides a sufficiently descent direction for the objective function. Moreover, if exact line search is used, the method reduces to the standard PRP method. Under suitable conditions, we show that the method with some backtracking line search or the generalized Wolfe-type line search is globally convergent. We also report some numerical results and compare the performance of the method with some existing conjugate gradient methods. The results show that the proposed method is efficient. | |||
| TO cite this article:Cheng Wanyou ,Li Donghui . A Two Term PRP Based Descent Method[OL].[15 December 2006] http://en.paper.edu.cn/en_releasepaper/content/10338 | |||
| 8. Self-Adaptive Projection Method for Co-Coercive Variational Inequalities | |||
| Bing-Sheng He,Henry X. Liu,Ting Wu,Xiao-Zheng He | |||
| Mathematics 02 August 2006 | |||
| Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
| Abstract:In some real-world problems, the mapping of the variational inequalities does not have any explicit forms and only the function value can be evaluated or observed for given variables. In this case, if the mapping is co-coercive, the basic projection method is applicable. However, in order to determine the step size, the existing basic projection method needs to know the co-coercive modulus in advance. In practice, usually even if the mapping can be characterized co-coercive, it is difficult to evaluate the modulus, and a conservative estimation will lead an extremely slow convergence. In view of this point, this paper presents a self-adaptive projection method without knowing the co-coercive modulus. We also give a real-life example to demonstrate the practicability of the proposed method. | |||
| TO cite this article:Bing-Sheng He,Henry X. Liu,Ting Wu, et al. Self-Adaptive Projection Method for Co-Coercive Variational Inequalities[OL].[ 2 August 2006] http://en.paper.edu.cn/en_releasepaper/content/7791 | |||
| 9. New Convergence Theorems of Homotopy Method for Constrained Non-convex Programming | |||
| Wenjuan Sun,Qinhuai Liu | |||
| Mathematics 04 November 2005 | |||
| Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
| Abstract:In this paper, we use combined interior homotopy method to solve constrained non-convex programming. We get some results for homo- topy pathway. We also prove that, when the homotopy map is a regular map, the K-K-T point obtained from homotopy algorithm can | |||
| TO cite this article:Wenjuan Sun,Qinhuai Liu. New Convergence Theorems of Homotopy Method for Constrained Non-convex Programming[OL].[ 4 November 2005] http://en.paper.edu.cn/en_releasepaper/content/3510 | |||
| Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
 |
|
||||||||||||||
| Results per page: | 49 Total, 5 Pages | << First < Previous 2 3 4 5 |
About Sciencepaper Online |
Privacy Policy |
Terms & Conditions |
Contact Us
Technology Partner - CERNET