论文信息 - A linearly constrained algorithm not requiring derivative continuity - 字舞流文

A linearly constrained algorithm not requiring derivative continuity

J. Strodiot | V. Nguyen

[1] Leon S. Lasdon,et al. Optimization Theory of Large Systems , 1970 .

[2] P. Wolfe. Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .

[3] C. Lemaréchal. An extension of davidon methods to non differentiable problems , 1975 .

[4] Robert Mifflin,et al. An Algorithm for Constrained Optimization with Semismooth Functions , 1977, Math. Oper. Res..

[5] Robert Mifflin,et al. A stable method for solving certain constrained least squares problems , 1979, Math. Program..

[6] Godwin C. Ovuworie,et al. Mathematical Programming: Structures and Algorithms , 1979 .

[7] R. Saigal. The Fixed Point Approach to Nonlinear Programming , 1979 .

[8] J. Hiriart-Urruty. Lipschitz $r$-continuity of the approximative subdifferential of a convex function. , 1980 .

[9] Klaus Schittkowski,et al. More test examples for nonlinear programming codes , 1981 .

[10] C. Lemaréchal,et al. ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION , 1981 .

[11] Jean-Jacques Strodiot,et al. ε-Optimal solutions in nondifferentiable convex programming and some related questions , 1983, Math. Program..

[12] V. Braibant,et al. Some applications of dual methods to optimal design of elastic structures , 1984 .