Smoothing and SAA method for stochastic programming problems with non-smooth objective and constraints
type: Item
instance of: scholarly article
title: Smoothing and SAA method for stochastic programming problems with non-smooth objective and constraints
zbMATH Open document ID: 1353.90097
author: Guihua Lin
author: Mei-Ju Luo
author: Jin Zhang
published in: Journal of Global Optimization
publication date: 2016-12-06T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6661488
zbMATH Keywords: non-smoothness
zbMATH Keywords: smoothing
zbMATH Keywords: sample average approximation
zbMATH Keywords: stochastic mathematical program with equilibrium constraints
MaRDI profile type: Publication
full work available at URL: s10898-016-0413-9
OpenAlex ID: W2287104589
cites work: Optimization and nonsmooth analysis
cites work: A special newton-type optimization method
cites work: Sensitivity Analysis of the Value Function for Parametric Mathematical Programs with Equilibrium Constraints
cites work: Point-to-Set Maps in Mathematical Programming
cites work: Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
cites work: Q4079324
cites work: Some Noninterior Continuation Methods for Linear Complementarity Problems
cites work: Monte Carlo and quasi-Monte Carlo sampling methods for a class of stochastic mathematical programs with equilibrium constraints
cites work: Mathematical Programs with Equilibrium Constraints
cites work: Q4003879
cites work: Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
cites work: Error bounds for generalized Lagrange multipliers in locally Lipschitz programming
cites work: Q4252828
cites work: Implicit smoothing and its application to optimization with piecewise smooth equality constraints
cites work: Lagrange multipliers and subderivatives of optimal value functions in nonlinear programming
cites work: Variational Analysis
cites work: A Linearization Method for Nonsmooth Stochastic Programming Problems
cites work: Q4830009
cites work: Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
cites work: Monte Carlo sampling approach to stochastic programming
cites work: Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation
cites work: Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
cites work: Smooth sample average approximation of stationary points in nonsmooth stochastic optimization and applications
cites work: Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
cites work: Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
cites work: Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
cites work: Stability of the solution set of perturbed nonsmooth inequality systems and application
DOI: 10.1007/S10898-016-0413-9
description: scientific article; zbMATH DE number 6661488