Nonsmooth Optimization: Proceedings of a IIASA Workshop, March 28-April 8, 1977Claude Lemaréchal, Robert Mifflin |
Contents
Preface | 1 |
Nondifferentiable Optimization and | 31 |
An Extension of the Method of Subgradients | 51 |
Copyright | |
6 other sections not shown
Other editions - View all
Common terms and phrases
a¹,x a¹‚x algorithm Application Approximation assume Balinski bundle methods computing condition numbers Conjugate Subgradients constraints Convergence Conditions Convergence Rate Convex Functions Cybernetics defined Demjanov denote descent direction Descent Method differentiable directional derivative Doklady Ermolev execution of Step exists extremal-value function f(xx feasible finite function f given Gradient Method IIASA inequalities iteration Kibern Kibernetika Lagrange multipliers least squares problem Lemarechal Lemma lim inf line-search linear programming Lipschitz matrix Method for Solving Mifflin Minimax Minimization Method Moscow Nauk Nauka Nondifferentiable Optimization Nonlinear Programming NONSMOOTH OPTIMIZATION Nurminskii Operations Research P(xx Poljak Programming Problems Proof Pshenichnyi quasidifferentiable rate of convergence relaxation method Russian satisfied semismooth sequence SIAM Journal solution Soviet Math Space Dilation Stochastic Programming subgradient method subgradient optimization Suppose Systems Theorem tion vector Vf(x Wolfe xk+1 xx+1 Yu.M ε ε