Global Convergence - Globe Thesis

Keyword [Global Convergence] Result: 81 - 100 \| Page: 5 of 10
81.	A Superlinearly Convergent Norm-Relaxed Method Of Feasible Directions For Finely Discretized Problems From Semi-Infinite Programming
82.	A New Generalized Gradient Projection Algorithm
83.	Differential-Algebraic Algorithm And Sequential Penalty Algorithm For Semidefinite Programming
84.	Trust Region Algorithms For Nonlinear Constrained Optimization Problems
85.	Study Of Parallel Optimization Algorithms
86.	On Gradient-Related Memory Method In Unconstrained Optimization
87.	On The Memory Gradient Method And Its Applications In Solving The System Of Nonlinear Equation
88.	A New Gradient Path In Unconstrained Optimization
89.	A Class Of Modified Trust Region Methods
90.	A New Conjugate Gradient Formula And Its Applications
91.	A Quadratically Constrained Quadratic Algorithm Model For Nonlinear MINIMAX Problems
92.	A New Type Of Conjugate Gradient Methods
93.	A Method Of Strongly Sub-Feasible Direction Combining Norm-Relaxed QP Subproblem With System Of Linear Equations For Constrained Optimization
94.	Applications Of Barzilai-Borwein Method And Filter Technology In Optimization
95.	BFGS Methods For Solving Symmetric Nonlinear Equations With Strongly Monotone
96.	The Proximal Point Algorithm And The Global Algorithm For DC Programming
97.	A Method For The Nonlinear Complementarity Problem With Constrained Optimization Reformulation
98.	A New Trust Region Algorithm With Conic Model
99.	Convergence Of The New Descent Conjugate Gradient Methods
100.	Research On The Smoothing Algorithm And The SQP Method For Mathematical Programs With Equilibrium Constraints
<<First <Prev Next> Last>> Jump to