Lines Matching refs:cite

1197 interpolation scheme found in {cite}`cgt`, is the default.
1472 interpolation scheme found in {cite}`cgt`, is the default.
1597 method {cite}`nocedal2006numerical`, the Hestenes-Stiefel method, and the
1618 The Nelder-Mead algorithm {cite}`nelder.mead:simplex` is a
1724 {cite}`bertsekas:projected` with the following variable
1960 multipliers. {cite}`boyd` The algorithm solves problems in
2052 Lagrangian {cite}`hestenes1969multiplier` {cite}`powell1969method`
2055 formulation {cite}`rockafellar1974augmented` that utilizes a
2449 framework as described in {cite}`dfobook` in order to
2452 {cite}`unedf0`.
2650 nonlinear complementarity problem {cite}`cottle:nonlinear`.
2654 {cite}`karush:minima` {cite}`kuhn.tucker:nonlinear`. In the simple
2664 and engineering {cite}`ferris.pang:engineering`, game theory
2665 {cite}`nash:equilibrium`, and finance
2666 {cite}`huang.pang:option`.
2676 {cite}`munson.facchinei.ea:semismooth` {cite}`deluca.facchinei.ea:semismooth`
2677 {cite}`facchinei.fischer.ea:semismooth` for solving mixed complementarity
2680 function {cite}`fischer:special`. A nonsmooth Newton method
2720 {cite}`mifflin:semismooth` {cite}`qi:convergence` {cite}`qi.sun:nonsmooth`.
2729 $B$-subdifferential {cite}`qi.sun:nonsmooth` of
2734 {cite}`armijo:minimization` is used to find the new
2736 {cite}`grippo.lampariello.ea:nonmonotone` are also available
2806 The GPCG {cite}`more-toraldo` algorithm is much like the
2842 OWLQN {cite}`owlqn` is a numerical approach to optimizing
2854 The TRON {cite}`lin_c3` algorithm is an active-set method
2978 searches include Moré-Thuente {cite}`more:92`, Armijo, gpcg,