Nonconvex robust programming via value-function optimization
type: Item
instance of: scholarly article
title: Nonconvex robust programming via value-function optimization
zbMATH Open document ID: 1469.90099
author: Ying Cui
author: Ziyu He
author: Jong-Shi Pang
published in: Computational Optimization and Applications
publication date: 2021-06-01T00:00:00Z
Mathematics Subject Classification ID: 90C17
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7353233
zbMATH Keywords: robust optimization
zbMATH Keywords: nonconvex
zbMATH Keywords: nonsmooth
zbMATH Keywords: value function
MaRDI profile type: Publication
full work available at URL: s10589-020-00245-4
OpenAlex ID: W3108721040
cites work: On the dual representation of coherent risk measures
cites work: Exact Penalization of Generalized Nash Equilibrium Problems
cites work: Q3182207
cites work: Theory and Applications of Robust Optimization
cites work: Robust Optimization for Unconstrained Simulation-Based Problems
cites work: Nonconvex robust optimization for problems with constraints
cites work: Expected Residual Minimization Method for Stochastic Linear Complementarity Problems
cites work: Robust solution of monotone stochastic linear complementarity problems
cites work: Generalized Gradients and Applications
cites work: Optimization and nonsmooth analysis
cites work: MultiComposite Nonconvex Optimization for Training Deep Neural Networks
cites work: Composite Difference-Max Programs for Modern Statistical Estimation Problems
cites work: The Theory of Max-Min, with Applications
cites work: Exact penalization via dini and hadamard conditional derivatives
cites work: Q3972960
cites work: Regularity conditions and exact penalty functions in Lipschitz programming problems
cites work: Exact Penalty Functions in Constrained Optimization
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Non-cooperative games with minmax objectives
cites work: Robust Portfolio Selection Problems
cites work: On linear programs with linear complementarity constraints
cites work: MM optimization algorithms
cites work: Global error bounds for convex multifunctions and applications
cites work: Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
cites work: Mathematical Programs with Equilibrium Constraints
cites work: Perturbation Analysis of a Condition Number for Linear Systems
cites work: Q3320132
cites work: Error bounds for lower semicontinuous functions in normed spaces
cites work: Error bounds in mathematical programming
cites work: Computing B-Stationary Points of Nonsmooth DC Programs
cites work: Nonconvex Games with Side Constraints
cites work: Introduction to Piecewise Differentiable Equations
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: Robust asset allocation
cites work: On robust solutions to uncertain linear complementarity problems and their variants
cites work: Robust Regression and Lasso
DOI: 10.1007/S10589-020-00245-4
description: scientific article; zbMATH DE number 7353233