minimax problems - Globe Thesis

Keyword [minimax problems] Result: 1 - 20 \| Page: 1 of 2
1.	Some Algorithms For Solving Finite, Semifinite And Generalized Semifinite Minimax Problems
2.	Research On Sequential Quadratics Programming Method For Solving Constrained Optimization
3.	Numerical Methods For Large Scale Sparse Minimax Problems
4.	Feasible Generalized Monotone Line Search SQP Algorithm For Nonlinear MINIMAX Problems With Inequality Constraits
5.	Generalized Monotone Line Search SQP Algorithm For Constrained Minimax Problems
6.	A Quadratically Constrained Quadratic Algorithm Model For Nonlinear MINIMAX Problems
7.	Generalized Pattern Search Methods For Optimization Problems
8.	A Class Of Filter Methods For Solving The Minimax Problem
9.	Pattern Search Methods For Nonlinear Optimization Problems
10.	A Feasible Incremental Algorithm For Solving Inequality Constrained Minimax Problems
11.	Spline Smoothing Methods For Nonlinear Programming
12.	Research On Qp-free And Generalized Gradient Projection Algorithms For Nonlinear Optimization Problems
13.	A New Superlinearly Convergent Norm-Relaxed Sqp Method For Constrained Minimax Problems
14.	The Study Of A Class Of Nonlinear Lagranee Method For Unconstrained Minimax Problems
15.	Exact Solutions For Minimax Optimization Problems
16.	Filter Algorithm For A Class Of Compound Nonsmooth Extreme Value Problems
17.	An Active Set Smoothing Newton Algorithm For Solving Finite Dimensional Unconstrained Minimax Problems
18.	An Active Set Smoothing Newton Algorithm For Solving Unconstrained Minimax Problems
19.	An Aggregate Homotopy Method For Solving Unconstrained Minimax Problems
20.	The Nonmonotone Filter Methods For Minimax Problems
<<First <Prev Next> Last>> Jump to