Modified proximal point algorithm for extended linear-quadratic programming
From MaRDI portal
Publication:1203069
DOI10.1007/BF00253806zbMath0764.90067OpenAlexW1982944912MaRDI QIDQ1203069
Publication date: 4 February 1993
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00253806
saddle pointextended linear-quadratic programmingquasi-Newton variationsvariations of the proximal point approach
Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Solving large-scale minimax problems with the primal-dual steepest descent algorithm, Convergence analysis of some methods for minimizing a nonsmooth convex function
Cites Work
- Monotone (nonlinear) operators in Hilbert space
- Computational schemes for large-scale problems in extended linear- quadratic programming
- Characterization of solution sets of convex programs
- Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- A Lagrangian finite generation technique for solving linear-quadratic problems in stochastic programming
- Least Change Secant Updates for Quasi-Newton Methods
- Some continuity properties of polyhedral multifunctions
- Quasi-Newton Methods, Motivation and Theory
- Monotone Operators and the Proximal Point Algorithm
- Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming
- Linear-Quadratic Programming and Optimal Control
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
