Optimization: Proceedings of the Fifth French-German Conference held in Castel-Novel (Varetz), France, Oct. 3-8, 1988
Springer Berlin Heidelberg, Dec 6, 1989 - Mathematics - 228 pages
The 2-yearly French-German Conferences on Optimization review the state-of-the-art and the trends in the field. The proceedings of the Fifth Conference include papers on projective methods in linear programming (special session at the conference), nonsmooth optimization, two-level optimization, multiobjective optimization, partial inverse method, variational convergence, Newton type algorithms and flows and on practical applications of optimization. A. Ioffe and J.-Ph. Vial have contributed survey papers on, respectively second order optimality conditions and projective methods in linear programming.
What people are saying - Write a review
We haven't found any reviews in the usual places.
A smoothing technique for nondifferentiable optimization problems
Numerical study of projective methods for linear programming
Applications and numerical convergence of the partial inverse method
8 other sections not shown
Other editions - View all
admissible sequence affine analytic center applications approximation assume assumption compact compute concave function concave minimization cone consider constraints convex function convex programming convex set CPCC(XxY defined definition denote dual equations equivalent exists feasibility problem feasible point Fifth French-German Conference finite given graph Hence hk-i implies inequality interior interior point methods Karmarkar's Karmarkar's algorithm Lagrange multiplier Lemma lim inf linear programming linesearch Lipschitz Lipschitz continuous lower bound Math matrix minimax Newton flows Newton step Newton's method nonlinear nonlinear programming norm null space number of iterations obtain optimal solution optimization problems parameter polynomial polytope primal projective algorithm projective methods Proof Proposition prove quadratic resp Rockafellar saddle point satisfies search direction second order Section solving space Springer Verlag 1989 sufficient condition Theorem update variables vector vertex vertices X X Y x(Xk zero