default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 117
Volume 117, Numbers 1-2, March 2009
- Jong-Shi Pang, Daniel Ralph:
Foreword: Special issue on nonlinear programming, variational inequalities, and stochastic programming. 1-4 - Jérôme Bolte, Aris Daniilidis
, Adrian S. Lewis:
Tame functions are semismooth. 5-19 - J. Frédéric Bonnans, Audrey Hermant:
No-gap second-order optimality conditions for optimal control problems with a single state constraint and control. 21-50 - Xiaojun Chen, Chao Zhang, Masao Fukushima:
Robust solution of monotone stochastic linear complementarity problems. 51-80 - Geng Deng, Michael C. Ferris:
Variable-Number Sample-Path Optimization. 81-109 - Darinka Dentcheva, Andrzej Ruszczynski:
Optimization with multivariate stochastic dominance constraints. 111-127 - Asen L. Dontchev, R. Tyrrell Rockafellar:
Robinson's implicit function theorem and its extensions. 129-147 - Emil Ernst, Michel Théra:
On the necessity of the Moreau-Rockafellar-Robinson qualification condition in Banach spaces. 149-161 - Francisco Facchinei, Andreas Fischer, Veronica Piccialli:
Generalized Nash equilibrium problems and Newton methods. 163-194 - M. Seetharama Gowda, Jiyuan Tao:
Z-transformations on proper and symmetric cones. 195-221 - Gül Gürkan, Jong-Shi Pang:
Approximations of Nash equilibria. 223-253 - Alexander D. Ioffe, Yoshiyuki Sekiguchi:
Regularity estimates for convex multifunctions. 255-270 - Alexey F. Izmailov, Mikhail V. Solodov:
On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions. 271-304 - Diethard Klatte, Bernd Kummer:
Optimization methods and stability of inclusions in Banach spaces. 305-330 - Boris S. Mordukhovich:
Multiobjective optimization problems with equilibrium constraints. 331-354 - Christina Oberlin, Stephen J. Wright:
An accelerated Newton method for equations with semismooth Jacobians and nonlinear complementarity problems. 355-386 - Paul Tseng, Sangwoon Yun:
A coordinate gradient descent method for nonsmooth separable minimization. 387-423 - Michael J. Todd:
Largest dual ellipsoids inscribed in dual cones. 425-434 - Michael Ulbrich, Stefan Ulbrich:
Primal-dual interior-point methods for PDE-constrained optimization. 435-485
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-13 00:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
