Font Size:
a
A
A
Keyword [Superlinear convergence]
Result: 41 - 60 | Page: 3 of 6
41.
Nonmonotone BFGS Method For Nonconvex Unconstrained Optimization
42.
Research On New Methods For Solving Unconstrained Optimization Problem
43.
A Norm-Relaxed Method With Identification Function For General Constrained Optimization
44.
A Strongly Sub-Feasible Primal-Dual Interior Point Algorithm For Nonlinear Inequality Constrained Optimization
45.
A Globally And Superlinearly Convergent Primal-Dual Interior Point QP-Free Algorithm For General Constrained Optimization
46.
Quasi-Newton Method For Variational Inequality
47.
Smoothing Quasi-Newton For P
0
Function Nonlinear Complementarity Problem
48.
Application Of Waveform Relaxation Methods To Delay Differential Equations Of Neutral Type
49.
A Trust Region-Line Search Method Using PSB Update
50.
Analysis Of Numerical Algorithms For Several Classes Of Optimization Problems
51.
PSB Method For Symmetric Nonlinear Equations
52.
A Class Of Modified Gradient Projection Algorithms For Convex Constrained Problems
53.
The Nonmonotone Line Search Technique And Its Applications
54.
A Modified Quasi-Newton Method And It's Convergence
55.
A New Class Of Quasi-newton Algorithm And Its Convergence
56.
A Modified SQP Algorithm For Nonlinearly Inequality Constrained Optimization
57.
Conditions For The Superlinear Convergence Of Quasi-Newton Methods On Degenerate Solutions
58.
A Nonmonotone Smoothing Newton Algorithm For Solving Zero-one Nonlinear Integer Programming Problems
59.
A Study On Semismooth Algorithm For Nonlinear Complementarity Problem
60.
An Inexact Smoothing Newton Method For Solving P
0
-NCP Problems
<<First
<Prev
Next>
Last>>
Jump to