Nondifferentiable Optimization: Motivations and Applications: Proceedings of an IIASA (International Institute for Applied Systems Analysis) Workshop on Nondifferentiable Optimization Held at Sopron, Hungary, September 17–22, 1984: Lecture Notes in Economics and Mathematical Systems, cartea 255
Editat de Vladimir F. Demyanov, Diethard Pallaschkeen Limba Engleză Paperback – oct 1985
Din seria Lecture Notes in Economics and Mathematical Systems
-
Preț: 366.40 lei -
Preț: 370.46 lei - 15%
Preț: 634.38 lei -
Preț: 369.36 lei - 15%
Preț: 493.79 lei - 15%
Preț: 616.67 lei -
Preț: 365.65 lei -
Preț: 369.53 lei -
Preț: 429.25 lei -
Preț: 478.35 lei -
Preț: 370.26 lei -
Preț: 363.99 lei -
Preț: 384.48 lei - 15%
Preț: 618.34 lei -
Preț: 364.71 lei -
Preț: 437.67 lei -
Preț: 371.00 lei - 15%
Preț: 619.61 lei -
Preț: 364.71 lei -
Preț: 332.45 lei -
Preț: 409.58 lei -
Preț: 363.99 lei - 18%
Preț: 745.61 lei -
Preț: 377.68 lei -
Preț: 386.37 lei - 15%
Preț: 621.48 lei -
Preț: 367.70 lei -
Preț: 363.99 lei - 15%
Preț: 613.00 lei - 15%
Preț: 622.29 lei -
Preț: 363.41 lei -
Preț: 430.76 lei - 15%
Preț: 619.61 lei -
Preț: 371.37 lei - 15%
Preț: 629.18 lei -
Preț: 399.23 lei -
Preț: 395.89 lei -
Preț: 383.75 lei -
Preț: 383.75 lei - 15%
Preț: 610.96 lei - 20%
Preț: 628.32 lei -
Preț: 365.45 lei -
Preț: 476.52 lei -
Preț: 364.35 lei - 15%
Preț: 612.55 lei -
Preț: 371.20 lei -
Preț: 364.19 lei - 15%
Preț: 640.81 lei -
Preț: 365.65 lei
Preț: 380.09 lei
Puncte Express: 570
Preț estimativ în valută:
67.29€ • 78.35$ • 58.46£
67.29€ • 78.35$ • 58.46£
Carte tipărită la comandă
Livrare economică 23 februarie-09 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540159797
ISBN-10: 3540159797
Pagini: 364
Ilustrații: VI, 355 p. 25 illus.
Dimensiuni: 170 x 244 x 19 mm
Greutate: 0.58 kg
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Economics and Mathematical Systems
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540159797
Pagini: 364
Ilustrații: VI, 355 p. 25 illus.
Dimensiuni: 170 x 244 x 19 mm
Greutate: 0.58 kg
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Economics and Mathematical Systems
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
I. Concepts in Nonsmooth Analysis.- Attempts to Approximate a Set-Valued Mapping.- Miscellanies on Nonsmooth Analysis and Optimization.- Bundle Methods, Cutting-Plane Algorithms and ?-Newton Directions.- The Solution of a Nested Nonsmooth Optimization Problem.- Variations on the Theme of Nonsmooth Analysis: Another Subdifferential.- Lipschitzian Stability in Optimization: The Role of Nonsmooth Analysis.- Upper-Semicontinuously Directionally Differentiable Functions.- A New Approach to Clarke’s Gradients in Infinite Dimensions.- II. Multicriteria Optimization and Control Theory.- A Nondifferentiable Approach to Multicriteria Optimization.- Application of a Subdifferential of a Convex Composite Functional to Optimal Control in Variational Inequalities.- On Some Nondifferentiable Problems in Optimal Control.- On Sufficient Conditions for Optimality of Lipschitz Functions and Their Applications to Vector Optimization.- Optimal Control of Hyperbolic Variational Inequalities.- On Duality Theory Related to Approximate Solutions of Vector-Valued Optimization Problems.- III. Algorithms and Optimization Methods.- Seminormal Functions in Optimization Theory.- The General Concept of Cone Approximations in Nondifferentiable Optimization.- An Algorithm for Convex NDO Based on Properties of the Contour Lines of Convex Quadratic Functions.- A Note on the Complexity of an Algorithm for Tchebycheff Approximation.- Descent Methods for Nonsmooth Convex Constrained Minimization.- Stability Properties of Infima and Optimal Solutions of Parametric Optimization Problems.- On Methods for Solving Optimization Problems Without Using Derivatives.- An Accelerated Method for Minimizing a Convex Function of Two Variables.- On the Steepest-Descent Method for a Class of Quasi-DifferentiableOptimization Problems.- A Modified Ellipsoid Method for the Minimization of Convex Functions With Superlinear Convergence (or Finite Termination) for Well-Conditioned C3 Smooth (or Piecewise Linear) Functions.- Numerical Methods for Multiextremal Nonlinear Programming Problems With Nonconvex Constraints.- A Modification of the Cutting-Plane Method With Accelerated Convergence.- A Finite Algorithm for Solving Linear Programs With an Additional Reverse Convex Constraint.- IV. Stochastic Programming and Applications.- Some Remarks on Quasi-Random Optimization.- Optimal Satellite Trajectories: a Source of Difficult Nonsmooth Optimization Problems.- A Reduced Subgradient Algorithm for Network Flow Problems With Convex Nondifferentiable Costs.- An Algorithm for Solving a Water-Pressure-Control Planning Problem With a Nondifferentiable Objective Function.- Quasi-Differentiable Functions in the Optimal Construction of Electrical Circuits.