✦ LIBER ✦

Interior Proximal Algorithm for Quasiconvex Programming Problems and Variational Inequalities with Linear Constraints

✍ Scribed by Brito, Arnaldo S.; Cruz Neto, J. X.; Lopes, Jurandir O.; Oliveira, P. Roberto

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interior point algorithms for linear pro

✍ Clovis C. Gonzaga 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 700 KB

Solving Variational Inequality Problems

✍ Deren Han; Hong K. Lo 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 120 KB

An affine scaling algorithm for linear p

✍ Michael L. Dowling 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 693 KB

A superlinearly convergent Newton-like a

✍ Liping Zhang; Yanlian Lai 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 105 KB

An interior-proximal method for convex l

✍ Alfred Auslender; Mounir Haddou 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 1021 KB

Sensitivity analysis based heuristic alg

✍ Terry L. Friesz; Roger L. Tobin; Hsun-Jung Cho; Nihal J. Mehta 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 880 KB