Select Subject

All (8830)

Agronomy (158)

Animal Husbandry,... (64)

Aquatic Science (16)

Astronomy (36)

Aviation (22)

Basic Medicine (184)

Biology (504)

Chemical Engineering (103)

Chemistry (635)

Civil and Archite... (105)

Clinical Medicine (236)

Computer Science ... (924)

Dynamic and Elect... (121)

Earth Science (119)

Economics (67)

Education (31)

Electrics, Commun... (927)

Energy Science an... (67)

Engineering and T... (15)

Environmental Sci... (140)

Food Science and ... (63)

Forestry (36)

Hydraulic Enginee... (40)

Mechanics (240)

Metallurgical Eng... (32)

Mine Engineering ... (38)

Nuclear Science a... (21)

Pharmacy (98)

Physics (920)

Preventive Medici... (37)

Psychology (20)

Security Science ... (17)

Sports Science (6)

Surveying and Map... (15)

Textile Science a... (16)

Traditional Chine... (56)

Transportation En... (57)

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. The optimization conditions for generalized complementarity problems based on generalized Fisher-Burmeister functions
	Wei-Zhe Gu,Mohamed A.Tawhid
	Mathematics 17 June 2016
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this article, we consider an unconstrained minimization reformulation of the generalized complementarity problem GCP(f, g) based on the generalized Fisher-Burmeister function. Starting with the continuously differentiable functions f and g, we show under certain conditions any stationary point of the unconstrained minimization problem is a solution to GCP .
	TO cite this article:Wei-Zhe Gu,Mohamed A.Tawhid. The optimization conditions for generalized complementarity problems based on generalized Fisher-Burmeister functions[OL].[17 June 2016] http://en.paper.edu.cn/en_releasepaper/content/4697419


	2. Three Types of Topological Indices of the Join of k Graphs
	LI Jing,WEI Fuyi
	Mathematics 19 January 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The join of two vertex disjoint graphs is obtained from their union by including all edges between the vertices in one graph and the vertices in the other. This paper mainly focused on the calculation formulas of Wiener indices, hyper-Wiener indices and reverse Wiener indices of the join of k graphs based on two definitions.
	TO cite this article:LI Jing,WEI Fuyi. Three Types of Topological Indices of the Join of k Graphs[OL].[19 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4516584


	3. A line search filter-SQP method for nonlinear inequality constrained optimization
	YUAN Jing,ZHU Detong
	Mathematics 19 June 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Filter methods are extensively studied for solving nonlinearprogramming problems (NLP). In this paper, the author propose the sequencequadratic programming method with a line search filter technique fornonlinear inequality constrained problems. The search direction ofthis algorithm is generated by first-order necessary conditions,while a backtracking line search procedure is used to generate stepsize. The second order correction is employed to overcome theMaratos effect. Local convergent rate and global convergence areestablished under some suitable conditions. Finally, the results ofnumerical experiments indicate that the proposed method is efficientfor the given test problems.
	TO cite this article:YUAN Jing,ZHU Detong. A line search filter-SQP method for nonlinear inequality constrained optimization[OL].[19 June 2012] http://en.paper.edu.cn/en_releasepaper/content/4482733


	4. A Conjugate Gradient Path Method without Line Search Technique for Unconstrained Optimization
	WANG Jueyu,ZHU Detong
	Mathematics 18 April 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, we propose a new approach via discrete conjugate gradient path for solving unconstrained optimization. The conjugate gradient path is obtained by constructing quadratic model of the objective function. The global convergence and local quadratic or superlinear convergence rate of the proposed algorithm are established under some reasonable conditions. Finally, the numerical results are reported to show the effectiveness of the proposed algorithm.
	TO cite this article:WANG Jueyu,ZHU Detong. A Conjugate Gradient Path Method without Line Search Technique for Unconstrained Optimization[OL].[18 April 2012] http://en.paper.edu.cn/en_releasepaper/content/4474920


	5. Combined Homotopy Method For Solving Nonconvex
	Liu Qinghuai,Wang Xiuyu,Jiang Xingwu
	Mathematics 05 February 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:For solving nonlinear nonconvex programming problem with a bounded feasible set. An aggregate constraint shifting function with a parameter and a combined homotopy equation are proposed, under the conditions of the feasible set bounded 、connectedand 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 prove. Numerical examples conclued that this method is feasible and effective.
	TO cite this article:Liu Qinghuai,Wang Xiuyu,Jiang Xingwu. Combined Homotopy Method For Solving Nonconvex [OL].[ 5 February 2009] http://en.paper.edu.cn/en_releasepaper/content/28428


	6. A Aggregate Constraint Shifting Combined Homotopy Method for Solving Nonlinear Programming
	Wang Xiuyu,Jiang Xingwu,Liu qinghuai
	Mathematics 05 February 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:For solving nonlinear nonconvex programming problem only with inequality constraint, We construct aggregate constraint shifting function with a parameter , and combined homotopy equation, under very weak conditions of the feasible set bounded、 connected and the regularity of the boundary.The convergence of a smooth homotopy path which from any interior point or any infeasible interior point to a solution of the problem is proved. Numerical examples concluded that this method is feasible and effective.
	TO cite this article:Wang Xiuyu,Jiang Xingwu,Liu qinghuai. A Aggregate Constraint Shifting Combined Homotopy Method for Solving Nonlinear Programming[OL].[ 5 February 2009] http://en.paper.edu.cn/en_releasepaper/content/28421


	7. How to decide whether an arbitrary undirected graph except for the graph of knight\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
	Xu Wandong
	Mathematics 17 January 2008
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In the article one advanced some important concepts: cut-off-able edge, cut-off-unable edge, openable edge, unopenable edge, openable region, unopenable region, closed corridor, opened corridor, adjoint subgraph of the vertex of $d(v) geq 3$, the subgraph of double bridges with double chains, the forbidden subgraph to the Hamiltonian, etc. And one advanced and shown the necessary and sufficient condition of deciding an arbitrary undirected graph except the one of knight\\\\\\\\\\\\\\\
	TO cite this article:Xu Wandong. How to decide whether an arbitrary undirected graph except for the graph of knight\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\[OL].[17 January 2008] http://en.paper.edu.cn/en_releasepaper/content/18174

Select/Unselect all

For Selected Papers

Saved Papers

Please enter a name for this paper to be shown in your personalized Saved Papers list

Third-level Subject

Combinatorial Optimization(0)
Decision Theory(1)
Dynamic Programming(2)
Game Theory(3)
Graph Theory(42)
Non-linear Programming(19)
Optimization(51)
Other Subjects of Operati...(5)
Overall Planning Theory(0)
Parametric Programming(0)
Queuing Theory(1)
Search Theory(0)
Stochastic Programming(1)

Rank

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.

	Check out RSS, or use RSS reader to subscribe this item