Exact penalization in stochastic programming -- calmness and constraint qualification

DOI10.1155/2014/569458zbMath1307.90122OpenAlexW2025342414WikidataQ59044516 ScholiaQ59044516MaRDI QIDQ2260525

Martin Branda

Publication date: 11 March 2015

Published in: Advances in Decision Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/569458

Mathematics Subject Classification ID

Stochastic programming (90C15)

Cites Work

• On the convergence of a smooth penalty algorithm without computing global solutions
• Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization
• Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints
• Almost sure central limit theorem of sample quantiles
• Optimization on metric and normed spaces
• On relaxing the Mangasarian-Fromovitz constraint qualification
• Exact penalty results for mathematical programs with vanishing constraints
• Smoothing approximation to the square-order exact penalty functions for constrained optimization
• Approximation and contamination bounds for probabilistic programs
• Pattern definition of the \(p\)-efficiency concept
• Augmented Lagrangian method for probabilistic optimization
• An exact penalty approach to constrained minimization problems on metric spaces
• On relations between chance constrained and penalty function problems under discrete distributions
• A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems
• Log-concavity of compound distributions with applications in stochastic optimization
• Robustness of optimal portfolios under risk and stochastic dominance constraints
• Calmness of constraint systems with applications
• Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
• A Gradient Formula for Linear Chance Constraints Under Gaussian Distribution
• Stochastic programming problems with generalized integrated chance constraints
• Calmness and Exact Penalization
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• Lectures on Stochastic Programming
• Optimization and nonsmooth analysis
• An Exact Penalization Viewpoint of Constrained Optimization
• Lipschitzian stability of constraint systems and generalized equations
• Variational Analysis
• The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
• Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
• Exact Penalization, Level Function Method, and Modified Cutting-Plane Method for Stochastic Programs with Second Order Stochastic Dominance Constraints
• Nonlinear Programming
• Stochastic optimization of insurance portfolios for managing exposure to catastrophic risks
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact penalization in stochastic programming -- calmness and constraint qualification