Progressive Hedging Algorithm in Operations Research Seminar
Explore the Progressive Hedging algorithm discussed in the Graduate Seminar on Operations Research. Topics include general framework, resource allocation examples, and handling non-convexity in decision-making. Dive into scenario decomposition and scenario-specific decision-making for well-hedged so
0 views • 28 slides
Convex Hulls in Computational Geometry
Convex hulls are a fundamental concept in computational geometry, representing the smallest convex shape that contains a set of points. The process involves defining the convexity of a set, determining the unique convex polygon, and computing the convex hull efficiently using algorithms. This conten
0 views • 9 slides
Bond Valuation Models and Yield Relationship
Explore the fundamentals of bond valuation, including the present value model and the yield model, to understand how bond prices are determined based on factors like market price, coupon payments, and yield to maturity. Learn about the price-yield curve, convexity, and how to calculate expected yiel
1 views • 25 slides
Poverty Traps: Implications and Solutions
Poverty traps theory, as proposed by Xavier Sala-i-Martin, explores the dynamics that keep countries in a cycle of poverty. It identifies three main traps: savings trap, non-convexity in production, and demographic trap. The theory suggests that to break out of poverty traps, countries may need incr
0 views • 27 slides
ROBUST STOCHASTIC APPROXIMATION APPROACH TO STOCHASTIC PROGRAMMING
Discussed are stochastic optimization problems, including convex-concave saddle point problems. Solutions like stochastic approximation and sample average approximation are analyzed. Theoretical assumptions and notations are explained, along with classical SA algorithms. Further discussions delve in
0 views • 41 slides
Efficient Strategies in Geometric Algorithms
Strategy optimization in geometric algorithms focusing on guessing a hidden card, data querying for quick retrieval, and intersection algorithms for polygons and polytopes in 2D and 3D spaces. Discussion on polygon representation, affine transformations, and convexity invariance.
0 views • 14 slides
Autonomous Hybrid Beamforming for mmWave Massive MIMO Systems
Explore the use of deep reinforcement learning for fully autonomous hybrid beamforming in mmWave massive MIMO systems, addressing non-convexity and non-linearity challenges. The approach involves interaction between agents and environments to update neural network parameters, optimizing system perfo
0 views • 7 slides
Understanding Convex Optimization Functions and Sets
Explore the concepts of convex functions and sets in Convex Optimization, including definitions, conditions of convexity, examples such as Softmax and Mutual Entropy, and their relation to convex sets. Learn about operations that preserve convexity, conjugate functions, log-concave/log-convex functi
0 views • 42 slides
Understanding Mortgage Backed Securities and Credit Enhancements
Dive into the world of mortgage backed securities (MBS) and credit enhancements with insights on different types of MBS, investor preferences, and various credit enhancement techniques. Explore the nuances of Agency Guarantees, CDOs, Convexity, Covered Bonds, and more, to enhance your knowledge in r
18 views • 25 slides
Convex Optimization Lecture: Sets, Functions, and Problems
Explore the fundamentals of convex optimization, including sets, functions, and problem statements. Learn about convexity, basic convex sets, separating hyperplanes, and dual cones. Understand how to define convex functions and sets, and examine the specifications and properties of convex sets in op
0 views • 33 slides
Learning and Testing Submodular Functions: Insights and Applications
Explore the world of submodular functions, from their discrete analog of convexity/concavity to approximate learning techniques and positive results in valuation functions and beyond. Discover the potential applications in optimization and algorithmic game theory.
0 views • 19 slides