Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming

From MaRDI portal
Publication:4277511

DOI10.1137/0803039zbMath0788.65069OpenAlexW1996903464MaRDI QIDQ4277511

Ciyou Zhu, R. Tyrrell Rockafellar

Publication date: 6 June 1994

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/62e97add3178020fcb655faff3776dc6ed11e695



Related Items

Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems, Solving large-scale minimax problems with the primal-dual steepest descent algorithm, An SQP algorithm for extended linear-quadratic problems in stochastic programming, Newton's method for quadratic stochastic programs with recourse, Sensitivity analysis for generalized linear-quadratic problems, A parallel inexact Newton method for stochastic programs with recourse, A predictor-corrector method for extended linear-quadratic programming, On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems., An SQP-type method and its application in stochastic programs, Modified proximal point algorithm for extended linear-quadratic programming, An inexact Lagrange-Newton method for stochastic quadratic programs with recourse, Dynamic portfolio optimization: time decomposition using the maximum principle with a scenario approach, Combining stochastic programming and optimal control to decompose multistage stochastic optimization problems, A dual gradient-projection method for large-scale strictly convex quadratic problems, A subgradient-type method for the equilibrium problem over the fixed point set and its applications, Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs, Newton-type methods for stochastic programming., Random test problems and parallel methods for quadratic programs and quadratic stochastic programs