Nonlinear programming - Globe Thesis

Keyword [Nonlinear programming] Result: 81 - 100 \| Page: 5 of 10
81.	Homotopy JFNK Method For Solving Nonlinear Programming
82.	The Decompositional Augmented Lagrangian Function Method In Nonlinear Programming And The Decomposition Theory In The Vector-Valued Optimization
83.	Convergences Of Two Classes Of Conjugated Gradient Methods And Properties Of The Augmented Lagrangian Function
84.	A Class Of Global Convergence Algorithm For Nonlinear Programming
85.	Smooth Penalty Functions And Penalty Algorithms For Solving Nonlinear Programming Problems
86.	Optimality Condition Of Constrained Nonlinear Programming Research
87.	The Auxiliary Function Method For Nonlinear Global Optimization
88.	A Hybrid Approximate Proximal Point Method For Minimizing The Sum Of Two Convex Functions
89.	The Auxiliary Function Method For Nonlinear Global Optimization
90.	A Transformation Function Method For (Solving) Constrained(Nonlinear) Global Optimization (Problems)
91.	Two New Filled Functions Based On Differential Dynamic Systems
92.	Studies On Filled Function Algorithm For Global Optimization
93.	Hybrid Filter Trust Region Algorithm Based Upon SLP Combined With SQP For Nonlinear Optimization Problem
94.	Two Kinds Of Nonlinear Programming Problems Of Global Optimization
95.	Multiplier Method With A New Class Of NCP Function
96.	Research Of Data Quality Control And Optimization Algorithm Based On Seismic Interpretation And Modeling
97.	The Two Descending Dimension Methods For Nonlinear Programing Problem
98.	Residential Choice Based On Urban Traffic And Location Index
99.	Studies On Optimality Conditions And Convexification Methods For A Class Of Global Optimization
100.	Genetic Algorithms For Two Classes Of Nonlinear Programming Problems With Interval Parameters
<<First <Prev Next> Last>> Jump to