Nonlinear programming - Globe Thesis

Keyword [Nonlinear programming] Result: 61 - 80 \| Page: 4 of 10
61.	An Interior-Point Method With Double Slack Vectors For Nonconvex Nonlinear Programming
62.	The Filled Function Method For Solving Constrained Global Optimization
63.	The Improved Algorithm Of The Nonlinear Programming For Constrained Inequality Systems
64.	A Modified SQP Algorithm With Limited Memory For Solving NLP Problems
65.	Improved Algorithm Of Wolfe For The Linear Constrained Nonlinear Programming Problem
66.	Study On Deterministic Algorithms For Global Optimization Problem
67.	Studies On Several Algorithms For Nonlinear Constrained Programming
68.	Further Discussions On An Interior-Point Method With Double Slack Vectors For Nonconvex Nonlinear Programming
69.	Research On Algorithm Of Seqential Quadratic Programming For Nonlinear Programming Problems
70.	Filled Function Method For Solving The Global Optimization Of Nonlinear Programming
71.	Optimality And Higher Order Duality In Nonlinear Programming
72.	Applying Infeasible Interior Point Method To SQP For Constrained Nonlinear Programming
73.	The Improved Algorithm And Applied Research Of Penalty Function Method
74.	Genetic Algorithm And Its Application In Nonlinear Programming
75.	A Primal-Dual Interior-Point FS Algorithm And Its Global Convergence
76.	Filled Function For Nonlinearly Global Optimization
77.	Trust-region Algorithm For Nonlinear Programming
78.	The Upper And Lower Bound Estimations Of Nonlinear Optimization Problems
79.	The Two Penalty Function For Constrained Nonlinear Programming Problem
80.	Two Classes Of Filled Function For Constrained Global Optimization Problem
<<First <Prev Next> Last>> Jump to