An adaptive sampling augmented Lagrangian method for stochastic optimization with deterministic constraints

DOI10.1016/j.camwa.2023.09.014arXiv2305.01018OpenAlexW4387275301MaRDI QIDQ6072951

Boyan Stefanov Lazarov, Brendan Keith, Cem Karamanli, Raghu Bollapragada, Socratis Petrides, Jingyi Wang

Publication date: 13 October 2023

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.01018

zbMATH Keywords

stochastic optimizationconstrained optimizationmachine learningaugmented Lagrangianengineering designadaptive sampling

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Stochastic programming (90C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Explicit Link between Gaussian Fields and Gaussian Markov Random Fields: The Stochastic Partial Differential Equation Approach
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Level set based robust shape and topology optimization under random field uncertainties
• Efficient topology optimization in MATLAB using 88 lines of code
• Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
• An adaptive augmented Lagrangian method for large-scale constrained optimization
• Sample size selection in optimization methods for machine learning
• Lectures on convex optimization
• On general minimax theorems
• Inexact accelerated augmented Lagrangian methods
• An adaptive Monte Carlo algorithm for computing mixed logit estimators
• Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
• Stochastic optimization using a trust-region method and random models
• Sub-sampled Newton methods
• Inexact stochastic mirror descent for two-stage nonlinear stochastic programs
• A primal-dual algorithm for risk minimization
• Algorithms for stochastic optimization with function or expectation constraints
• Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
• Optimization of PDEs with uncertain inputs
• Multiplier and gradient methods
• Risk-averse design of tall buildings for uncertain wind conditions
• Adaptive augmented Lagrangian methods: algorithms and practical numerical experience
• Strongly Convex Functions, Moreau Envelopes, and the Generic Nature of Convex Functions with Strong Minimizers
• Optimal Budget Allocation for Sample Average Approximation
• Filters in topology optimization based on Helmholtz-type differential equations
• Hybrid Deterministic-Stochastic Methods for Data Fitting
• A fractional PDE model for turbulent velocity fields near solid walls
• Optimal Control of Uncertain Systems Using Sample Average Approximations
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Adaptive Sampling Strategies for Stochastic Optimization
• On Sampling Rates in Simulation-Based Recursions
• Optimization Methods for Large-Scale Machine Learning
• Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization
• Optimization for Data Analysis
• Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints
• SI-ADMM: A Stochastic Inexact ADMM Framework for Stochastic Convex Programs
• Lectures on Stochastic Programming: Modeling and Theory, Third Edition
• A Statistical Framework for Generating Microstructures of Two-Phase Random Materials: Application to Fatigue Analysis
• Analysis of Boundary Effects on PDE-Based Sampling of Whittle--Matérn Random Fields
• Proximité et dualité dans un espace hilbertien
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
• Exact and inexact subsampled Newton methods for optimization
• Convex analysis and monotone operator theory in Hilbert spaces
• Topology optimization of nonlinear elastic structures and compliant mechanisms
• Iteration-complexity of first-order augmented Lagrangian methods for convex programming

This page was built for publication: An adaptive sampling augmented Lagrangian method for stochastic optimization with deterministic constraints