, Line search filter methods for nonlinear programming: Local convergence, Res. Report RC 23033, IBM T. J. Watson Research Center, Yorktown, 2004. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
{log}: A Language For Programming In Logic With Finite Sets - Dovier, Omodeo, Pontelli, .. (1996) (Correct)
....sequence of consecutive actions reaches an end, a similar 9 exhaustive treatment of e 1 is triggered in the case of actions 9(a)iv and 9(b)iv. The collection of all terms appearing as sides of equations in E can be represented as a forest structure with superimposed links, akin to the one in [43]. 3 Initially, a link connects two leaves in G E if and only if the two are labeled by the 3 As usual, there will be an ordered m tuple of edges issuing from a node labeled f=m and there will be no edge issuing from a variable node. 14 A. DOVIER et al. same variable. An execution of action 6 ....
Paterson, M. S. and Wegman, M. N., Linear unification, IBM Thomas J. Watson Research Center, Yorktown Heights, 1976.
Interior-Point l_2-Penalty Methods for Nonlinear Programming.. - Chen, Goldfarb (2004) Self-citation (Nonlinear) (Correct)
No context found.
, Line search filter methods for nonlinear programming: Local convergence, Res. Report RC 23033, IBM T. J. Watson Research Center, Yorktown, 2004.
Interior-Point l_2-Penalty Methods for Nonlinear Programming.. - Chen, Goldfarb (2004) Self-citation (Nonlinear Convergence) (Correct)
No context found.
, Line search filter methods for nonlinear programming: Motivation and global convergence, Res. Report RC 23036, IBM T. J. Watson Research Center, Yorktown, 2004.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC