Search
Search Results
##search.searchResults.foundPlural##
-
A Robust SQP Method for Optimization with Inequality Constraints
32610 3651 pp. 247-256 -
On the Convergence of the Factorization Update Algorithm
33249 3479 pp. 236-249 -
A Class of Revised Broyden Algorithms Without Exact Line Search
34342 4034 pp. 11-20 -
A New Smoothing Equations Approach to the Nonlinear Complementarity Problems
32015 3577 pp. 747-758 -
A Truly Globally Convergent Feasible Newton-Type Method for Mixed Complementarity Problems
33334 3375 pp. 347-360 -
A Revised Conjugate Gradient Projection Algorithm for Inequality Constrained Optimizations
32561 3455 pp. 217-224 -
A New Trust-Region Algorithm for Finite Minimax Problem
35504 3604 pp. 262-278 -
A QP Free Feasible Method
34837 3578 pp. 651-660 -
Picard Iteration for Nonsmooth Equations
33161 3540 pp. 583-590 -
A Class of Modified Broyden Algorithms
34410 3641 pp. 366-379 -
Globally Convergent Inexact Generalized Newton Methods with Decreasing Norm of the Gradient
32361 3593 pp. 289-300 -
A Smoothing Levenberg-Marquardt Type Method for LCP
35111 3716 pp. 735-752 -
A Constrained Optimization Approach for LCP
34547 3354 pp. 509-522 -
A New Smoothing Approximation Method for Solving Box Constrained Variational Inequalities
32775 3499 pp. 533-542