Higher Order Iteration Schemes for Unconstrained Optimization

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

American Journal of Operations Research

ISSN Print: 2160-8830
ISSN Online: 2160-8849
www.scirp.org/journal/ajor
E-mail: ajor@scirp.org

Google-based Impact Factor: 0.84
Citations h5-index & Ranking*

Journals Menu

"Higher Order Iteration Schemes for Unconstrained Optimization"
written by Yangyang Shi, Pingqi Pan,
published by American Journal of Operations Research, Vol.1 No.3, 2011

has been cited by the following article(s):

Google Scholar
CrossRef

[1]	Linear programming computation
	Springer, 2014

[2]	Dual Simplex Phase-l Method
	Linear Programming Computation, Springer, 2014

[3]	Deficient-Basis Method
	Linear Programming Computation, Springer, 2014

[4]	Pivot Rule
	Linear Programming Computation, Springer, 2014

[5]	Interior-Point Method
	Linear Programming Computation, Springer, 2014

[6]	Face Method
	Linear Programming Computation, Springer, 2014

[7]	Implementation of the Simplex Method
	Linear Programming Computation, Springer, 2014

[8]	Duality Principle and Dual Simplex Method
	Linear Programming Computation, Springer, 2014

[9]	Pivotal Interior-Point Method
	Linear Programming Computation, Springer, 2014

[10]	Decomposition Method
	Linear Programming Computation, Springer, 2014

[11]	Dual Pivot Rule
	Linear Programming Computation, Springer, 2014

[12]	Simplex Method
	Linear Programming Computation, Springer, 2014

[13]	Improved Reduced Simplex Method
	Linear Programming Computation, Springer, 2014

[14]	Dual Face Method
	Linear Programming Computation, Springer, 2014

[15]	Simplex Phase-I Method
	Linear Programming Computation, Springer, 2014

[16]	Integer Linear Programming (ILP)
	Linear Programming Computation, Springer, 2014

[17]	Dual Deficient-Basis Method
	Linear Programming Computation, Springer, 2014

[18]	Sensitivity Analysis and Parametric LP
	Linear Programming Computation, Springer, 2014

[19]	Geometry of the Feasible Region
	Linear Programming Computation, Springer, 2014

[20]	Criss-Cross Simplex Method
	Linear Programming Computation, Springer, 2014

[21]	Reduced Simplex Method
	Linear Programming Computation, Springer, 2014

[22]	Generalizing Reduced Simplex Method
	Linear Programming Computation, Springer, 2014

[23]	Special Topics
	Linear Programming Computation, Springer, 2014

[24]	Variants of the Simplex Method
	Linear Programming Computation, Springer, 2014

[25]	D-Reduced Simplex Method
	Linear Programming Computation, 2014

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

American Journal of Operations Research

American Journal of Operations Research

Journals Menu

Home

About SCIRP

Service

Policies

[1]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_20

[2]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_19

[3]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_25

[4]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_12

[5]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_17

[6]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_5

[7]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_21

[8]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_23

[9]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_2

[10]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_24

[11]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_6

[12]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_13

[13]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_14

[14]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_18

[15]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_9

[16]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_11

[17]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_7

[18]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_8

[19]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_10

[20]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_1

[21]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_3

[22]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_15

[23]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_22

[24]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_4

[25]	Linear Programming Computation 2014 DOI:10.1007/978-3-642-40754-3_16