Skip to main content

6 Result(s)

within Article Remove this filter J. S. Pang Remove this filter Applications of Mathematics Remove this filter Calculus of Variations and Optimal Control; Optimization Remove this filter Optimization Remove this filter

and

  1. No Access

    Article

    Inexact algorithm for continuous complementarity problems on measure spaces

    In this paper, we discuss a type of complementarity problem posed over a measure space. We give some conditions under which there exists a solution for the problem and work toward a new inexact algorithm for i...

    S. Y. Wu, J. C. Yao, J. S. Pang in Journal of Optimization Theory and Applications (1996)

  2. No Access

    Article

    A globally convergent Newton method for convex SC1 minimization problems

    This paper presents a globally convergent and locally superlinearly convergent method for solving a convex minimization problem whose objective function has a semismooth but nondifferentiable gradient. Applica...

    J. S. Pang, L. Qi in Journal of Optimization Theory and Applications (1995)

  3. No Access

    Article

    Solution differentiability and continuation of Newton's method for variational inequality problems over polyhedral sets

    In this paper, we derive some further differentiability properties of solutions to a parametric variational inequality problem defined over a polyhedral set. We discuss how these results can be used to establi...

    J. S. Pang in Journal of Optimization Theory and Applications (1990)

  4. No Access

    Article

    More results on the convergence of iterative methods for the symmetric linear complementarity problem

    In an earlier paper, the author has given some necessary and sufficient conditions for the convergence of iterative methods for solving the linear complementarity problem. These conditions may be viewed as glo...

    J. S. Pang in Journal of Optimization Theory and Applications (1986)

  5. No Access

    Article

    Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem

    Necessary and sufficient conditions are established for the convergence of various iterative methods for solving the linear complementarity problem. The fundamental tool used is the classical notion of matrix ...

    J. S. Pang in Journal of Optimization Theory and Applications (1984)

  6. No Access

    Article

    On the convergence of a basic iterative method for the implicit complementarity problem

    In Part 1 of this study (Ref. 1), we have defined the implicit complementarity problem and investigated its existence and uniqueness of solution. In the present paper, we establish a convergence theory for a c...

    J. S. Pang in Journal of Optimization Theory and Applications (1982)