A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex Programming
Copyright policy )A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex Programming
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- National University of Singapore Singapore
- National University of Singapore Libraries Singapore
Self-concordant barrier, Large-scale problems in mathematical programming, multi-stage stochastic nonlinear programming, Convex programming, polynomial-time complexity, interior point methods, Stochastic programming, Interior-point methods, lagrangian dual, 510, Multi-stage stochastic nonlinear programming, Polynomial-time complexity, Lagrangian dual, Interior point methods, Abstract computational complexity for mathematical programming problems, self-concordant barrier
Self-concordant barrier, Large-scale problems in mathematical programming, multi-stage stochastic nonlinear programming, Convex programming, polynomial-time complexity, interior point methods, Stochastic programming, Interior-point methods, lagrangian dual, 510, Multi-stage stochastic nonlinear programming, Polynomial-time complexity, Lagrangian dual, Interior point methods, Abstract computational complexity for mathematical programming problems, self-concordant barrier
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).24 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!