An SQP-type method and its application in stochastic programs
From MaRDI portal
Publication:1411396
DOI10.1023/A:1022122521816zbMath1030.90142OpenAlexW114945733MaRDI QIDQ1411396
Xiaojun Chen, Liqun Qi, Zhi Wei
Publication date: 27 October 2003
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022122521816
Related Items
A new version of the Liu-Storey conjugate gradient method ⋮ New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems ⋮ The global convergence of a modified BFGS method for nonconvex functions ⋮ Global convergence properties of two modified BFGS-type methods ⋮ The projection technique for two open problems of unconstrained optimization problems ⋮ The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions ⋮ Global convergence of a modified BFGS-type method for unconstrained non-convex minimization ⋮ New quasi-Newton methods for unconstrained optimization problems ⋮ Convergence analysis of a modified BFGS method on convex minimizations ⋮ Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems ⋮ Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search ⋮ Continuity and Stability of a Quadratic Mixed-Integer Stochastic Program ⋮ A new backtracking inexact BFGS method for symmetric nonlinear equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate nonlinear programming algorithms for solving stochastic programs with recourse
- A general approach to convergence properties of some methods for nonsmooth convex optimization
- Inexact subgradient methods with applications in stochastic programming
- Optimization algorithm with probabilistic estimation
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- Finite master programs in regularized stochastic decomposition
- Epigraphical nesting: A unifying theory for the convergence of algorithms
- Continuous approximation schemes for stochastic programs
- An SQP algorithm for extended linear-quadratic problems in stochastic programming
- Newton's method for quadratic stochastic programs with recourse
- A parallel inexact Newton method for stochastic programs with recourse
- A nonsmooth version of Newton's method
- A Linearization Method for Nonsmooth Stochastic Programming Problems
- Epi‐consistency of convex stochastic programs
- Optimization and nonsmooth analysis
- A Lagrangian finite generation technique for solving linear-quadratic problems in stochastic programming
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Stability in Two-Stage Stochastic Programming
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- On the Convergence of Algorithms with Implications for Stochastic and Nondifferentiable Optimization
- Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming
- Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Subdifferential Convergence in Stochastic Programs
