Andrzej Ruszczynski

Orcid: 0000-0002-4571-1469

According to our database1, Andrzej Ruszczynski authored at least 92 papers between 1980 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An Integrated Transportation Distance between Kernels and Approximate Dynamic Risk Evaluation in Markov Systems.
SIAM J. Control. Optim., December, 2023

The deepest event cuts in risk-averse optimization with application to radiation therapy design.
Comput. Optim. Appl., December, 2023

Risk filtering and risk-averse control of Markovian systems subject to model uncertainty.
Math. Methods Oper. Res., October, 2023

Mini-Batch Risk Forms.
SIAM J. Optim., 2023

Fast Dual Subgradient Optimization of the Integrated Transportation Distance Between Stochastic Kernels.
CoRR, 2023

2022
Process-based risk measures and risk-averse control of discrete-time systems.
Math. Program., 2022

A Stochastic Subgradient Method for Distributionally Robust Non-convex and Non-smooth Learning.
J. Optim. Theory Appl., 2022

2021
A Stochastic Subgradient Method for Nonsmooth Nonconvex Multilevel Composition Optimization.
SIAM J. Control. Optim., 2021

Subregular recourse in nonlinear multistage stochastic optimization.
Math. Program., 2021

Risk-Averse Learning by Temporal Difference Methods with Markov Risk Measures.
J. Mach. Learn. Res., 2021

An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems.
J. Glob. Optim., 2021

Selective linearization for multi-block statistical learning.
Eur. J. Oper. Res., 2021

2020
A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization.
SIAM J. Optim., 2020

Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization.
Optim. Lett., 2020

Risk forms: representation, disintegration, and application to partially observable two-stage systems.
Math. Program., 2020

A Stochastic Subgradient Method for Distributionally Robust Non-Convex Learning.
CoRR, 2020

Risk-Averse Learning by Temporal Difference Methods.
CoRR, 2020

2018
Time-Coherent Risk Measures for Continuous-Time Markov Chains.
SIAM J. Financial Math., 2018

Risk measurement and risk-averse control of partially observable discrete-time Markov systems.
Math. Methods Oper. Res., 2018

2017
A Selective Linearization Method For Multiblock Convex Optimization.
SIAM J. Optim., 2017

Rate of Convergence of the Bundle Method.
J. Optim. Theory Appl., 2017

2015
Time-consistent approximations of risk-averse multistage stochastic optimization problems.
Math. Program., 2015

Two-stage portfolio optimization with higher-order conditional measures of risk.
Ann. Oper. Res., 2015

A Risk-Averse Analog of the Hamilton-Jacobi-Bellman Equation.
Proceedings of the 2015 Proceedings of the Conference on Control and its Applications, 2015

Dynamic Risk Measures for Finite-State Partially Observable Markov Decision Problems.
Proceedings of the 2015 Proceedings of the Conference on Control and its Applications, 2015

2014
Risk-Averse Control of Undiscounted Transient Markov Models.
SIAM J. Control. Optim., 2014

Erratum to: Risk-averse dynamic programming for Markov decision processes.
Math. Program., 2014

Risk preferences on the space of quantile functions.
Math. Program., 2014

Alternating linearization for structured regularization problems.
J. Mach. Learn. Res., 2014

Computational Methods for Risk-Averse Undiscounted Transient Markov Models.
Oper. Res., 2014

Lectures on Stochastic Programming - Modeling and Theory, Second Edition.
MOS-SIAM Series on Optimization 16, SIAM, ISBN: 978-1-61197-342-6, 2014

2013
Common Mathematical Foundations of Expected Utility and Dual Utility Theories.
SIAM J. Optim., 2013

2012
Tractable Almost Stochastic Dominance.
Eur. J. Oper. Res., 2012

Stochastic modeling and optimization (in honor of András Prékopa's 80th birthday).
Ann. Oper. Res., 2012

Scenario decomposition of risk-averse multistage stochastic programming problems.
Ann. Oper. Res., 2012

2011
Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and Decomposition.
Oper. Res., 2011

A Multiproduct Risk-Averse Newsvendor with Law-Invariant Coherent Measures of Risk.
Oper. Res., 2011

A multi-product risk-averse newsvendor with exponential utility function.
Eur. J. Oper. Res., 2011

2010
Risk-averse dynamic programming for Markov decision processes.
Math. Program., 2010

Robust stochastic dominance and its application to risk-averse optimization.
Math. Program., 2010

Commentary - Post-Decision States and Separable Approximations Are Powerful Tools of Approximate Dynamic Programming.
INFORMS J. Comput., 2010

Kusuoka representation of higher order dual risk measures.
Ann. Oper. Res., 2010

2009
Optimization with multivariate stochastic dominance constraints.
Math. Program., 2009

Lectures on Stochastic Programming - Modeling and Theory
MOS-SIAM Series on Optimization, SIAM, ISBN: 978-0-89871-875-1, 2009

2008
Optimization Problems with Second Order Stochastic Dominance Constraints: Duality, Compact Formulations, and Cut Generation Methods.
SIAM J. Optim., 2008

Stochastic Dynamic Optimization with Discounted Stochastic Dominance Constraints.
SIAM J. Control. Optim., 2008

A risk-averse newsvendor with law invariant coherent measures of risk.
Oper. Res. Lett., 2008

A merit function approach to the subgradient method with averaging.
Optim. Methods Softw., 2008

Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints.
Math. Program., 2008

Finding Normalized Equilibrium in Convex-concave Games.
IGTR, 2008

Risk-adjusted probability measures in portfolio optimization with coherent measures of risk.
Eur. J. Oper. Res., 2008

2007
Stability and Sensitivity of Optimization Problems with First Order Stochastic Dominance Constraints.
SIAM J. Optim., 2007

Corrigendum to: "Optimization of Convex Risk Functions, " <i>Mathematics of Operations Research</i> 31 (2006) 433 - 452.
Math. Oper. Res., 2007

An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems.
Oper. Res., 2007

2006
Relaxations of linear programming problems with first order stochastic dominance constraints.
Oper. Res. Lett., 2006

Inverse stochastic dominance constraints and rank dependent expected utility theory.
Math. Program., 2006

Conditional Risk Mappings.
Math. Oper. Res., 2006

Optimization of Convex Risk Functions.
Math. Oper. Res., 2006

2005
Beam search heuristic to solve stochastic integer problems under probabilistic constraints.
Eur. J. Oper. Res., 2005

Measuring Risk for Income Streams.
Comput. Optim. Appl., 2005

2004
Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints.
Math. Program., 2004

Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems.
Math. Oper. Res., 2004

Dual methods for probabilistic optimization problems <sup>*</sup>.
Math. Methods Oper. Res., 2004

2003
Optimization with Stochastic Dominance Constraints.
SIAM J. Optim., 2003

2002
Dual Stochastic Dominance and Related Mean-Risk Models.
SIAM J. Optim., 2002

A branch and bound method for stochastic integer problems under probabilistic constraints.
Optim. Methods Softw., 2002

Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra.
Math. Program., 2002

The Probabilistic Set-Covering Problem.
Oper. Res., 2002

Practice Abstracts.
Interfaces, 2002

Bounds for probabilistic integer programming problems.
Discret. Appl. Math., 2002

2001
On consistency of stochastic dominance and mean-semideviation models.
Math. Program., 2001

Constraint Aggregation in Infinite-Dimensional Spaces and Applications.
Math. Oper. Res., 2001

2000
Robust path choice in networks with failures.
Networks, 2000

Concavity and efficient points of discrete distributions in probabilistic programming.
Math. Program., 2000

1999
Proximal Decomposition Via Alternating Linearization.
SIAM J. Optim., 1999

From stochastic dominance to mean-risk models: Semideviations as risk measures.
Eur. J. Oper. Res., 1999

Some advances in decomposition methodsfor stochastic linear programming.
Ann. Oper. Res., 1999

1998
A branch and bound method for stochastic global optimization.
Math. Program., 1998

On the Glivenko-Cantelli Problem in Stochastic Programming: Linear Recourse and Extensions.
Math. Oper. Res., 1998

On the Glivenko-Cantelli problem in stochastic programming: Mixed-integer linear recourse.
Math. Methods Oper. Res., 1998

On Optimal Allocation of Indivisibles Under Uncertainty.
Oper. Res., 1998

1997
Decomposition methods in stochastic programming.
Math. Program., 1997

1996
Constraint aggregation principle in convex optimization.
Math. Program., 1996

On augmented Lagrangian decomposition methods for multistage stochastic programs.
Ann. Oper. Res., 1996

1995
On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization.
Math. Oper. Res., 1995

A New Scenario Decomposition Method for Large-Scale Stochastic Optimization.
Oper. Res., 1995

1994
An Extension of the DQA Algorithm to Convex Stochastic Programs.
SIAM J. Optim., 1994

1993
Parallel decomposition of multistage stochastic programming problems.
Math. Program., 1993

1992
A diagonal quadratic approximation method for large scale linear programs.
Oper. Res. Lett., 1992

1987
A Linearization Method for Nonsmooth Stochastic Programming Problems.
Math. Oper. Res., 1987

1986
A regularized decomposition method for minimizing a sum of polyhedral functions.
Math. Program., 1986

1980
Feasible direction methods for stochastic programming problems.
Math. Program., 1980


  Loading...