Discrete geometry and optimization / / Karoly Bezdek, Antoine Deza, Yinyu Ye, editors
| Discrete geometry and optimization / / Karoly Bezdek, Antoine Deza, Yinyu Ye, editors |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | New York, : Springer, 2013 |
| Descrizione fisica | 1 online resource (341 p.) |
| Disciplina | 516.11 |
| Altri autori (Persone) |
BezdekKaroly
YeYinyu DezaAntoine |
| Collana | Fields Institute communications |
| Soggetto topico |
Discrete geometry
Mathematical optimization |
| ISBN |
9783319002002
3319002007 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Discrete Geometry in Minkowski Spaces (Alonso, Martini, and Spirova) -- Engineering Branch-and-Cut Algorithms for the Equicut Program (Anjos, Liers, Pardella, and Schmutzer) -- An Approach to the Dodecahedral Conjecture Based on Bounds for Spherical Codes (Anstreicher) -- On Minimal Tilings with Convex Cells Each Containing a Unit Ball (Bezdek) -- On Volumes of Permutation Polytopes (Burggraf, De Loera, and Omar) -- Monotone Paths in Planar Convex Subdivisions and Polytopes (Dumitrescu, Rote, and Toth).- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Eisenberg-Nagy, Laurent, and Varvitsiotis) -- The Strong Dodecahedral Conjecture and Fejes Toth's Conjecture on Sphere Packings with Kissing Number Twelve (Hales) -- Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints (Jiang, Sun, and Toh) -- Techniques for Submodular Maximization (Lee) -- A Further Generalization of the Colourful Caratheodory theorem (Meunier, Deza) -- Expected Crossing Numbers (Mohar, Stephen) -- EL-Labelings and Canonical Spanning Trees for Subword Complexes (Pilaud, Stump) -- Bandwidth, Vertex Separators, and Eigenvalue Optimization (Rendl, Lisser, and Piacentini) -- Exploiting Symmetries in Polyhedral Computations (Schurmann) -- Conditions for Correct Sensor Network Localization Using SDP Relaxation (Shamsi, Taheri, Zhu, and Ye) -- A Primal-Dual Smooth Perceptron-von Neumann Algorithm (Soheili, Pena) -- Open Problems (Bezdek, Deza, and Ye). . |
| Record Nr. | UNINA-9910739450003321 |
| New York, : Springer, 2013 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Internet and Network Economics [[electronic resource] ] : First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005, Proceedings / / edited by Xiaotie Deng, Yinyu Ye
| Internet and Network Economics [[electronic resource] ] : First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005, Proceedings / / edited by Xiaotie Deng, Yinyu Ye |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XVII, 1106 p.) |
| Disciplina | 000 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Computer science
Computer communication systems Application software Computers and civilization Information storage and retrieval Popular Computer Science Computer Communication Networks Information Systems Applications (incl. Internet) Computers and Society Computer Appl. in Administrative Data Processing Information Storage and Retrieval |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recent Developments in Equilibria Algorithms -- Partially-Specified Large Games -- Exchange Market Equilibria with Leontief’s Utility: Freedom of Pricing Leads to Rationality -- A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property -- Click Fraud Resistant Methods for Learning Click-Through Rates -- Experiments with an Economic Model of the Worldwide Web -- Coordination Mechanisms for Selfish Scheduling -- Economic Mechanisms for Shortest Path Cooperative Games with Incomplete Information -- Truth-Telling Reservations -- Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions -- An Auction-Based Market Equilibrium Algorithm for a Production Model -- New Algorithms for Mining the Reputation of Participants of Online Auctions -- A Simple Characterization for Truth-Revealing Single-Item Auctions -- Prediction Games -- Walrasian Equilibrium: Hardness, Approximations and Tractable Instances -- On the Structure and Complexity of Worst-Case Equilibria -- Club Formation by Rational Sharing: Content, Viability and Community Structure -- Subjective-Cost Policy Routing -- Economic Analysis of Networking Technologies for Rural Developing Regions -- A Simple Graph-Theoretic Model for Selfish Restricted Scheduling -- A Cost Mechanism for Fair Pricing of Resource Usage -- A Delay Pricing Scheme for Real-Time Delivery in Deadline-Based Networks -- Game-Theoretic Analysis of Internet Switching with Selfish Users -- The Price of Anarchy of Cournot Oligopoly -- Incentives in Some Coalition Formation Games -- Enforcing Truthful Strategies in Incentive Compatible Reputation Mechanisms -- Strategy/False-Name Proof Protocols for Combinatorial Multi-attribute Procurement Auction: Handling Arbitrary Utility of the Buyer -- Practical Zero-Knowledge Arguments from ?-Protocols -- Bayesian Communication Leading to a Nash Equilibrium in Belief -- The Bahncard Problem with Interest Rate and Risk -- Optimal Starting Price in Online Auctions -- Time Interval-Based Prepaid Charging of QoS-Enabled IP Services -- Mining Stock Market Tendency Using GA-Based Support Vector Machines -- Model-Based Analysis of Money Accountability in Electronic Purses -- Applying Modified Fuzzy Neural Network to Customer Classification of E-Business -- Fuzzy Comprehensive Evaluation of E-commerce and Process Improvement -- Application of Integrated Web Services-Based E-business and Web Services-Based Business Process Monitoring -- A Note on the Cramer-Damgård Identification Scheme -- Formal Analysis and Improvement of the State Transition Model for Intrusion Tolerant System -- Secure Fingerprint-Based Remote User Authentication Scheme Using Smartcards -- New Authentication Protocol Providing User Anonymity in Open Network -- Effective Filtering for Collaborative Publishing -- Experimental Evaluation of an eBay-Style Self-reporting Reputation Mechanism -- An Architecture for Evolutionary Adaptive Web Systems -- A Collaborative E-learning System Based on Multi-agent -- A Class of Possibilistic Portfolio Selection Models and Algorithms -- An Empirical Study of Volatility Predictions: Stock Market Analysis Using Neural Networks -- A New Algorithm Based on Copulas for Financial Risk Calculation with Applications to Chinese Stock Markets -- Design of Anonymity-Preserving User Authentication and Key Agreement Protocol for Ubiquitous Computing Environments -- An Efficient Identity-Based Key Exchange Protocol with KGS Forward Secrecy for Low-Power Devices -- To Build a Blocklist Based on the Cost of Spam -- Total Dominating Set Games -- Local Flow Betweenness Centrality for Clustering Community Graphs -- Computerized Collaborative Support for Enhancing Human’s Creativity for Networked Community -- New Results on Online Replacement Problem -- Online Bin Packing of Fragile Objects with Application in Cellular Networks -- Online Algorithms for the Vehicle Scheduling Problem with Time Objective -- On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams -- A Computational Model of Mortgage Prepayment Options -- Efficient Algorithms for the Electric Power Transaction Problem -- Looking for Arbitrage or Term Structures in Frictional Markets -- A Framework on Compound Knowledge Push System Oriented to Organizational Employees -- Effective Decision Making by Self-evaluation in the Multi-agent Environment -- Overlay Based Mapping Egress Service Path Between MPLS Domains -- An Adaptive Group-Based Reputation System in Peer-to-Peer Networks -- A Comparative Study on Marketing Mix Models for Digital Products -- Optimal Pricing for Web Search Engines -- Pricing Strategy of Mixed Traditional and Online Distribution Channels Based on Stackelberg Game -- Packing Trees in Communication Networks -- Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines -- Incentive Compatible Multiagent Constraint Optimization -- Design of Incentive Compatible Mechanisms for Stackelberg Problems -- Proportional QoS in Differentiated Services Networks: Capacity Management, Equilibrium Analysis and Elastic Demands -- Can “Bill-and-Keep” Peering Be Mutually Beneficial? -- Design of P2P Grid Networking Architecture Using k-Redundancy Scheme Based Group Peer Concept -- An Integrated Classification Method: Combination of LP and LDA -- Cooperation Evolution of Indirect Reciprocity by Discrimination -- Fixed-Point Model and Schedule Reliability of Morning Commuting in Stochastic and Time-Dependent Transport Networks -- Computing Equilibria in a Fisher Market with Linear Single-Constraint Production Units -- Majority Equilibrium of Distribution Centers Allocation in Supply Chain Management -- Traversal Pattern Mining in Web Environment -- An Analysis of Search Engine Switching Behavior Using Click Streams -- Study on Improving Efficiency of Knowledge Sharing in Knowledge-Intensive Organization -- Traffic Models for Community-Based Ranking and Navigation -- On the Efficacy of Detecting and Punishing Selfish Peers -- Semantic Web Recommender System Based Personalization Service for User XQuery Pattern -- Multi-unit Combinatorial Reverse Auctions with Transformability Relationships Among Goods -- Winner Determination in Discount Auctions -- On the Competitive Ratio of the Random Sampling Auction -- The Pricing Strategies for Agents in Real E-commerce -- Why Do Information Gatekeepers Charge Zero Subscription Fees? -- Cost-Driven Web Service Selection Using Genetic Algorithm -- On Modeling Internet QoS Provisioning from Economic Models -- Metadata and Information Asset for Infomediary Business Model on Primary Product Market -- On Protection of Threatened Unstructured Overlays: An Economic Defense Model and Its Applications -- Outsourcing Internet Security: Economic Analysis of Incentives for Managed Security Service Providers -- Secure Construction of Virtual Organizations in Grid Computing Systems -- A Graph-Theoretic Network Security Game -- Nash Equilibria and Dominant Strategies in Routing -- Atomic Selfish Routing in Networks: A Survey -- Heuristic Approaches to Service Level Agreements in Packet Networks -- A Fixed Point Approach for the Computation of Market Equilibria -- New Results on the Complexity of Uniformly Mixed Nash Equilibria -- Nash Equilibria in All-Optical Networks -- Price of Anarchy, Locality Gap, and a Network Service Provider Game -- Network Traffic Analysis and Modeling for Games -- Price of Anarchy of Network Routing Games with Incomplete Information -- General Equilibrium for Economies with Harmful Overconsumption -- Expectations, Asymmetries, and Contributions -- A Quantile-Data Mapping Model for Value-at-Risk Based on BP and Support Vector Regression. |
| Record Nr. | UNISA-996465568603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Internet and network economics : first international workshop, WINE 2005, Hong Kong, China, December 15-17, 2005 : proceedings / / Xiaotie Deng, Yinyu Ye (eds.)
| Internet and network economics : first international workshop, WINE 2005, Hong Kong, China, December 15-17, 2005 : proceedings / / Xiaotie Deng, Yinyu Ye (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (XVII, 1106 p.) |
| Disciplina | 000 |
| Altri autori (Persone) |
DengXiaotie
YeYinyu |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Internet
Computer networks - Economic aspects Econometrics |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recent Developments in Equilibria Algorithms -- Partially-Specified Large Games -- Exchange Market Equilibria with Leontief’s Utility: Freedom of Pricing Leads to Rationality -- A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property -- Click Fraud Resistant Methods for Learning Click-Through Rates -- Experiments with an Economic Model of the Worldwide Web -- Coordination Mechanisms for Selfish Scheduling -- Economic Mechanisms for Shortest Path Cooperative Games with Incomplete Information -- Truth-Telling Reservations -- Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions -- An Auction-Based Market Equilibrium Algorithm for a Production Model -- New Algorithms for Mining the Reputation of Participants of Online Auctions -- A Simple Characterization for Truth-Revealing Single-Item Auctions -- Prediction Games -- Walrasian Equilibrium: Hardness, Approximations and Tractable Instances -- On the Structure and Complexity of Worst-Case Equilibria -- Club Formation by Rational Sharing: Content, Viability and Community Structure -- Subjective-Cost Policy Routing -- Economic Analysis of Networking Technologies for Rural Developing Regions -- A Simple Graph-Theoretic Model for Selfish Restricted Scheduling -- A Cost Mechanism for Fair Pricing of Resource Usage -- A Delay Pricing Scheme for Real-Time Delivery in Deadline-Based Networks -- Game-Theoretic Analysis of Internet Switching with Selfish Users -- The Price of Anarchy of Cournot Oligopoly -- Incentives in Some Coalition Formation Games -- Enforcing Truthful Strategies in Incentive Compatible Reputation Mechanisms -- Strategy/False-Name Proof Protocols for Combinatorial Multi-attribute Procurement Auction: Handling Arbitrary Utility of the Buyer -- Practical Zero-Knowledge Arguments from ?-Protocols -- Bayesian Communication Leading to a Nash Equilibrium in Belief -- The Bahncard Problem with Interest Rate and Risk -- Optimal Starting Price in Online Auctions -- Time Interval-Based Prepaid Charging of QoS-Enabled IP Services -- Mining Stock Market Tendency Using GA-Based Support Vector Machines -- Model-Based Analysis of Money Accountability in Electronic Purses -- Applying Modified Fuzzy Neural Network to Customer Classification of E-Business -- Fuzzy Comprehensive Evaluation of E-commerce and Process Improvement -- Application of Integrated Web Services-Based E-business and Web Services-Based Business Process Monitoring -- A Note on the Cramer-Damgård Identification Scheme -- Formal Analysis and Improvement of the State Transition Model for Intrusion Tolerant System -- Secure Fingerprint-Based Remote User Authentication Scheme Using Smartcards -- New Authentication Protocol Providing User Anonymity in Open Network -- Effective Filtering for Collaborative Publishing -- Experimental Evaluation of an eBay-Style Self-reporting Reputation Mechanism -- An Architecture for Evolutionary Adaptive Web Systems -- A Collaborative E-learning System Based on Multi-agent -- A Class of Possibilistic Portfolio Selection Models and Algorithms -- An Empirical Study of Volatility Predictions: Stock Market Analysis Using Neural Networks -- A New Algorithm Based on Copulas for Financial Risk Calculation with Applications to Chinese Stock Markets -- Design of Anonymity-Preserving User Authentication and Key Agreement Protocol for Ubiquitous Computing Environments -- An Efficient Identity-Based Key Exchange Protocol with KGS Forward Secrecy for Low-Power Devices -- To Build a Blocklist Based on the Cost of Spam -- Total Dominating Set Games -- Local Flow Betweenness Centrality for Clustering Community Graphs -- Computerized Collaborative Support for Enhancing Human’s Creativity for Networked Community -- New Results on Online Replacement Problem -- Online Bin Packing of Fragile Objects with Application in Cellular Networks -- Online Algorithms for the Vehicle Scheduling Problem with Time Objective -- On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams -- A Computational Model of Mortgage Prepayment Options -- Efficient Algorithms for the Electric Power Transaction Problem -- Looking for Arbitrage or Term Structures in Frictional Markets -- A Framework on Compound Knowledge Push System Oriented to Organizational Employees -- Effective Decision Making by Self-evaluation in the Multi-agent Environment -- Overlay Based Mapping Egress Service Path Between MPLS Domains -- An Adaptive Group-Based Reputation System in Peer-to-Peer Networks -- A Comparative Study on Marketing Mix Models for Digital Products -- Optimal Pricing for Web Search Engines -- Pricing Strategy of Mixed Traditional and Online Distribution Channels Based on Stackelberg Game -- Packing Trees in Communication Networks -- Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines -- Incentive Compatible Multiagent Constraint Optimization -- Design of Incentive Compatible Mechanisms for Stackelberg Problems -- Proportional QoS in Differentiated Services Networks: Capacity Management, Equilibrium Analysis and Elastic Demands -- Can “Bill-and-Keep” Peering Be Mutually Beneficial? -- Design of P2P Grid Networking Architecture Using k-Redundancy Scheme Based Group Peer Concept -- An Integrated Classification Method: Combination of LP and LDA -- Cooperation Evolution of Indirect Reciprocity by Discrimination -- Fixed-Point Model and Schedule Reliability of Morning Commuting in Stochastic and Time-Dependent Transport Networks -- Computing Equilibria in a Fisher Market with Linear Single-Constraint Production Units -- Majority Equilibrium of Distribution Centers Allocation in Supply Chain Management -- Traversal Pattern Mining in Web Environment -- An Analysis of Search Engine Switching Behavior Using Click Streams -- Study on Improving Efficiency of Knowledge Sharing in Knowledge-Intensive Organization -- Traffic Models for Community-Based Ranking and Navigation -- On the Efficacy of Detecting and Punishing Selfish Peers -- Semantic Web Recommender System Based Personalization Service for User XQuery Pattern -- Multi-unit Combinatorial Reverse Auctions with Transformability Relationships Among Goods -- Winner Determination in Discount Auctions -- On the Competitive Ratio of the Random Sampling Auction -- The Pricing Strategies for Agents in Real E-commerce -- Why Do Information Gatekeepers Charge Zero Subscription Fees? -- Cost-Driven Web Service Selection Using Genetic Algorithm -- On Modeling Internet QoS Provisioning from Economic Models -- Metadata and Information Asset for Infomediary Business Model on Primary Product Market -- On Protection of Threatened Unstructured Overlays: An Economic Defense Model and Its Applications -- Outsourcing Internet Security: Economic Analysis of Incentives for Managed Security Service Providers -- Secure Construction of Virtual Organizations in Grid Computing Systems -- A Graph-Theoretic Network Security Game -- Nash Equilibria and Dominant Strategies in Routing -- Atomic Selfish Routing in Networks: A Survey -- Heuristic Approaches to Service Level Agreements in Packet Networks -- A Fixed Point Approach for the Computation of Market Equilibria -- New Results on the Complexity of Uniformly Mixed Nash Equilibria -- Nash Equilibria in All-Optical Networks -- Price of Anarchy, Locality Gap, and a Network Service Provider Game -- Network Traffic Analysis and Modeling for Games -- Price of Anarchy of Network Routing Games with Incomplete Information -- General Equilibrium for Economies with Harmful Overconsumption -- Expectations, Asymmetries, and Contributions -- A Quantile-Data Mapping Model for Value-at-Risk Based on BP and Support Vector Regression. |
| Altri titoli varianti | WINE 2005 |
| Record Nr. | UNINA-9910483096303321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Linear and nonlinear programming / / David G. Luenberger, Yinyu Ye
| Linear and nonlinear programming / / David G. Luenberger, Yinyu Ye |
| Autore | Luenberger David G. <1937-> |
| Edizione | [5th ed.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (609 pages) |
| Disciplina | 519.72 |
| Collana | International Series in Operations Research and Management Science |
| Soggetto topico | Linear programming |
| ISBN | 3-030-85450-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Contents -- 1 Introduction -- 1.1 Optimization -- 1.2 Types of Problems -- Linear Programming -- Conic Linear Programming -- Unconstrained Problems -- Constrained Problems -- 1.3 Complexity of Problems -- 1.4 Iterative Algorithms and Convergence -- Part I Linear Programming -- 2 Basic Properties of Linear Programs -- 2.1 Introduction -- 2.2 Examples of Linear Programming Problems -- 2.3 Basic Feasible Solutions -- 2.4 The Fundamental Theorem of Linear Programming -- 2.5 Relations to Convex Geometry -- 2.6 Farkas' Lemma and Alternative Systems -- 2.7 Summary -- 2.8 Exercises -- References -- 3 Duality and Complementarity -- 3.1 Dual Linear Programs and Interpretations -- 3.2 The Duality Theorem -- 3.3 Geometric and Economic Interpretations -- Dual Multipliers-Shadow Prices -- 3.4 Sensitivity and Complementary Slackness -- Sensitivity -- Complementary Slackness -- 3.5 Selected Applications of the Duality -- Robust and Distributionally Robust Optimization -- Online Linear Programming -- 3.6 Max Flow-Min Cut Theorem -- Max Flow Augmenting Algorithm -- Max Flow-Min Cut Theorem -- Relation to Duality -- 3.7 Summary -- 3.8 Exercises -- References -- 4 The Simplex Method -- 4.1 Adjacent Basic Feasible Solutions (Extreme Points) -- Nondegeneracy Assumption -- Determination of Vector to Leave Basis -- Conic Combination Interpretations -- 4.2 The Primal Simplex Method -- Determining an Optimal Feasible Solution -- The Simplex Procedure -- Finding an Initial Basic Feasible Solution -- 4.3 The Dual Simplex Method -- The Primal-Dual Algorithm -- 4.4 The Simplex Tableau Method -- Decomposition -- 4.5 The Simplex Method for Transportation Problems -- Finding a Basic Feasible Solution -- The Northwest Corner Rule -- Basis Triangularity -- The Transportation Simplex Method -- Simplex Multipliers -- Cycle of Change.
The Transportation Simplex Algorithm -- 4.6 Efficiency Analysis of the Simplex Method -- 4.7 Summary -- 4.8 Exercises -- References -- 5 Interior-Point Methods -- 5.1 Elements of Complexity Theory -- 5.2 The Simplex Method Is Not Polynomial-Time -- 5.3 The Ellipsoid Method -- Cutting Plane and New Containing Ellipsoid -- Convergence -- Ellipsoid Method for Usual Form of LP -- 5.4 The Analytic Center -- Cutting Plane and Analytic Volume of Reduction -- 5.5 The Central Path -- Dual Central Path -- Primal-Dual Central Path -- Duality Gap -- 5.6 Solution Strategies -- Primal Barrier Method -- Primal-Dual Path-Following -- Primal-Dual Potential Reduction Algorithm -- Iteration Complexity -- 5.7 Termination and Initialization -- Termination -- Initialization -- The HSD Algorithm -- 5.8 Summary -- 5.9 Exercises -- References -- 6 Conic Linear Programming -- 6.1 Convex Cones -- 6.2 Conic Linear Programming Problem -- 6.3 Farkas' Lemma for Conic Linear Programming -- 6.4 Conic Linear Programming Duality -- 6.5 Complementarity and Solution Rank of SDP -- Null-Space Rank Reduction -- Gaussian Projection Rank Reduction -- Randomized Binary Rank Reduction -- Objective-Guide Rank Reduction -- 6.6 Interior-Point Algorithms for Conic Linear Programming -- Initialization: The HSD Algorithm -- 6.7 Summary -- 6.8 Exercises -- References -- Part II Unconstrained Problems -- 7 Basic Properties of Solutions and Algorithms -- 7.1 First-Order Necessary Conditions -- Feasible and Descent Directions -- 7.2 Examples of Unconstrained Problems -- 7.3 Second-Order Conditions -- Sufficient Conditions for a Relative Minimum -- 7.4 Convex and Concave Functions -- Properties of Convex Functions -- Properties of Differentiable Convex Functions -- 7.5 Minimization and Maximization of Convex Functions -- 7.6 Global Convergence of Descent Algorithms -- Iterative Algorithms -- Descent. Closed Mappings -- Global Convergence Theorem -- Spacer Steps -- 7.7 Speed of Convergence -- Order of Convergence -- Linear Convergence -- Arithmetic Convergence -- Average Rates -- Convergence of Vectors -- Complexity -- 7.8 Summary -- 7.9 Exercises -- References -- 8 Basic Descent Methods -- 8.1 Line Search Algorithms -- 0th-Order Method: Golden Section Search and Curve Fitting -- Search by Golden Section -- Quadratic Fit -- 1st-Order Method: Bisection and Curve Fitting Methods -- The Bisection Method -- Quadratic Fit: Method of False Position -- Cubic Fit -- 2nd-Order Method: Newton's Method -- Global Convergence of Curve Fitting -- Closedness of Line Search Algorithms -- Inaccurate Line Search -- Armijo's Rule -- 8.2 The Method of Steepest Descent: First-Order -- The Method -- Global Convergence and Convergence Speed -- The Quadratic Case -- The Nonquadratic Case -- 8.3 Applications of the Convergence Theory and Preconditioning -- Scaling as Preconditioning -- 8.4 Accelerated Steepest Descent -- The Heavy Ball Method -- The Method of False Position -- 8.5 Multiplicative Steepest Descent -- Affine-Scaling Method -- Mirror-Descent Method -- 8.6 Newton's Method: Second-Order -- Order Two Convergence -- Modifications -- Newton's Method and Logarithms -- Self-concordant Functions -- 8.7 Sequential Quadratic Optimization Methods -- Trust Region Method -- A Homotopy or Path-Following Method -- 8.8 Coordinate and Stochastic Gradient Descent Methods -- Global Convergence -- Local Convergence Rate -- Convergence Speed of a Randomized Coordinate Descent Method -- Stochastic Gradient Descent (SGD) Method -- 8.9 Summary -- 8.10 Exercises -- References -- 9 Conjugate Direction Methods -- 9.1 Conjugate Directions -- 9.2 Descent Properties of the Conjugate Direction Method -- 9.3 The Conjugate Gradient Method -- Conjugate Gradient Algorithm. Verification of the Algorithm -- 9.4 The C-G Method as an Optimal Process -- Bounds on Convergence -- 9.5 The Partial Conjugate Gradient Method -- 9.6 Extension to Nonquadratic Problems -- Quadratic Approximation -- Line Search Methods -- Convergence -- Preconditioning and Partial Methods -- 9.7 Parallel Tangents -- 9.8 Exercises -- References -- 10 Quasi-Newton Methods -- 10.1 Modified Newton Method -- Other Modified Newton's Methods -- 10.2 Construction of the Inverse -- Rank One Correction -- 10.3 Davidon-Fletcher-Powell Method -- Positive Definiteness -- Finite Step Convergence -- 10.4 The Broyden Family -- Partial Quasi-Newton Methods -- 10.5 Convergence Properties -- Global Convergence -- Local Convergence -- 10.6 Scaling -- Improvement of Eigenvalue Ratio -- Scale Factors -- A Self-Scaling Quasi-Newton Algorithm -- 10.7 Memoryless Quasi-Newton Methods -- Scaling and Preconditioning -- 10.8 Combination of Steepest Descent and Newton's Method -- 10.9 Summary -- 10.10 Exercises -- References -- Part III Constrained Optimization -- 11 Constrained Optimization Conditions -- 11.1 Constraints and Tangent Plane -- Tangent Plane -- 11.2 First-Order Necessary Conditions (Equality Constraints) -- Sensitivity -- 11.3 Equality Constrained Optimization Examples -- Large-Scale Applications -- 11.4 Second-Order Conditions (Equality Constraints) -- Eigenvalues in Tangent Subspace -- Projected Hessians -- 11.5 Inequality Constraints -- First-Order Necessary Conditions -- The Lagrangian and First-Order Conditions -- Second-Order Conditions -- Sensitivity -- 11.6 Mix-Constrained Optimization Examples -- 11.7 Lagrangian Duality and Zero-Order Conditions -- 11.8 Rules for Constructing the Lagrangian Dual Explicitly -- 11.9 Summary -- 11.10 Exercises -- References -- 12 Primal Methods -- 12.1 Infeasible Direction and the Steepest Descent Projection Method. 12.2 Feasible Direction Methods: Sequential Linear Programming -- 12.3 The Gradient Projection Method -- Linear Constraints -- Nonlinear Constraints -- 12.4 Convergence Rate of the Gradient Projection Method -- Geodesic Descent -- Geodesics -- Lagrangian and Geodesics -- Rate of Convergence -- Problems with Inequalities -- 12.5 The Reduced Gradient Method -- Linear Constraints -- Global Convergence -- Nonlinear Constraints -- 12.6 Convergence Rate of the Reduced Gradient Method -- 12.7 Sequential Quadratic Optimization Methods -- 12.8 Active Set Methods -- Changes in Working Set -- 12.9 Summary -- 12.10 Exercises -- References -- 13 Penalty and Barrier Methods -- 13.1 Penalty Methods -- The Method -- Convergence -- 13.2 Barrier Methods -- The Method -- Convergence -- 13.3 Lagrange Multipliers in Penalty and Barrier Methods -- Lagrange Multipliers in the Penalty Method -- The Hessian Matrix -- Lagrange Multipliers in the Barrier Method -- 13.4 Newton's Method for the Logarithmic Barrier Optimization -- The KKT Condition System of the Logarithmic Barrier Function -- The KKT System of a ``Shifted'' Barrier -- The Interior Ellipsoidal-Trust Region Method with Barrier -- 13.5 Newton's Method for Equality Constrained Optimization -- Normalization of Penalty Functions -- Inequalities -- 13.6 Conjugate Gradients and Penalty Methods -- 13.7 Penalty Functions and Gradient Projection -- Underlying Concept -- Implementing the First Step -- Inequality Constraints -- 13.8 Summary -- 13.9 Exercises -- References -- 14 Local Duality and Dual Methods -- 14.1 Local Duality and the Lagrangian Method -- Inequality Constraints -- Partial Duality -- The Lagrangian Method: Dual Steepest Ascent -- Preconditioning or Scaling -- 14.2 Separable Problems and Their Duals -- Decomposition -- 14.3 The Augmented Lagrangian and Interpretation -- The Penalty Viewpoint. Geometric Interpretation. |
| Record Nr. | UNINA-9910508437503321 |
Luenberger David G. <1937->
|
||
| Cham, Switzerland : , : Springer, , [2021] | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Linear and Nonlinear Programming / / by David G. Luenberger, Yinyu Ye
| Linear and Nonlinear Programming / / by David G. Luenberger, Yinyu Ye |
| Autore | Luenberger David G |
| Edizione | [4th ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XIII, 546 p. 90 illus.) |
| Disciplina | 519.72 |
| Collana | International Series in Operations Research & Management Science |
| Soggetto topico |
Operations research
Decision making Management science Mathematical models Engineering economy Operations Research/Decision Theory Operations Research, Management Science Mathematical Modeling and Industrial Mathematics Engineering Economics, Organization, Logistics, Marketing |
| ISBN | 3-319-18842-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Part I Linear Programming -- Basic Properties of Linear Programs -- The Simplex Method -- Duality and Complementarity -- Interior-Point Methods -- Conic Linear Programming -- Part II Unconstrained Problems -- Basic Properties of Solutions and Algorithms -- Basic Descent Methods -- Conjugate Direction Methods -- Quasi-Newton Methods -- Part III Constrained Minimization -- Constrained Minimization Conditions -- Primal Methods -- Penalty and Barrier Methods -- Duality and Dual Methods -- Primal-Dual Methods -- Appendix A: Mathematical Review -- Appendix B: Convex Sets -- Appendix C: Gaussian Elimination -- Appendix D: Basic Network Concepts. |
| Record Nr. | UNINA-9910254929403321 |
Luenberger David G
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the first ACM International Workshop on Mobile Entity Localization and Tracking in GPS-Less Environments
| Proceedings of the first ACM International Workshop on Mobile Entity Localization and Tracking in GPS-Less Environments |
| Autore | Zhang Ying |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2008 |
| Descrizione fisica | 1 online resource (136 pages) |
| Collana | ACM Conferences |
| Soggetto topico |
Engineering & Applied Sciences
Computer Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti |
Proceedings of the first Association for Computing Machinery International Workshop on Mobile Entity Localization and Tracking in Global Positioning System-Less Environments
MELT '08 |
| Record Nr. | UNINA-9910376177803321 |
Zhang Ying
|
||
| [Place of publication not identified], : ACM, 2008 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Web and Internet Economics [[electronic resource] ] : 10th International Conference, WINE 2014, Beijing, China, December 14-17, 2014, Proceedings / / edited by Tie-Yan Liu, Qi Qi, Yinyu Ye
| Web and Internet Economics [[electronic resource] ] : 10th International Conference, WINE 2014, Beijing, China, December 14-17, 2014, Proceedings / / edited by Tie-Yan Liu, Qi Qi, Yinyu Ye |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIV, 500 p. 24 illus.) |
| Disciplina | 380.1 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Computer science
Computer Science, general |
| ISBN | 3-319-13129-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations -- Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria -- Limiting Price Discrimination when Selling Products with Positive Network Externalities -- Computing Approximate Nash Equilibria in Polymatrix Games -- Optimal Cost-Sharing in Weighted Congestion Games -- Truthful Multi-unit Procurements with Budgets -- The Shapley Value in Knapsack Budgeted Games -- Fast Convex Decomposition for Truthful Social Welfare Approximation -- A Near-Optimal Mechanism for Impartial Selection -- Value-based Network Externalities and Optimal Auction Design -- Matching Dynamics with Constraints -- Truthful Approximations to Range Voting -- Resource Competition on Integral Polymatroids -- PTAS for Minimax Approval Voting -- Biobjective Online Bipartite Matching -- Dynamic Reserve Prices for Repeated Auctions: Learning from Bids. |
| Record Nr. | UNISA-996210529003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Web and Internet Economics : 10th International Conference, WINE 2014, Beijing, China, December 14-17, 2014, Proceedings / / edited by Tie-Yan Liu, Qi Qi, Yinyu Ye
| Web and Internet Economics : 10th International Conference, WINE 2014, Beijing, China, December 14-17, 2014, Proceedings / / edited by Tie-Yan Liu, Qi Qi, Yinyu Ye |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIV, 500 p. 24 illus.) |
| Disciplina | 380.1 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Computer science
Computer Science, general |
| ISBN | 3-319-13129-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations -- Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria -- Limiting Price Discrimination when Selling Products with Positive Network Externalities -- Computing Approximate Nash Equilibria in Polymatrix Games -- Optimal Cost-Sharing in Weighted Congestion Games -- Truthful Multi-unit Procurements with Budgets -- The Shapley Value in Knapsack Budgeted Games -- Fast Convex Decomposition for Truthful Social Welfare Approximation -- A Near-Optimal Mechanism for Impartial Selection -- Value-based Network Externalities and Optimal Auction Design -- Matching Dynamics with Constraints -- Truthful Approximations to Range Voting -- Resource Competition on Integral Polymatroids -- PTAS for Minimax Approval Voting -- Biobjective Online Bipartite Matching -- Dynamic Reserve Prices for Repeated Auctions: Learning from Bids. |
| Record Nr. | UNINA-9910483535103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||