A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
From MaRDI portal
interior point methodsnonlinear complementarity problemoptimal controlsaddle point problemstochastic programming
Existence of solutions for minimax problems (49J35) Numerical optimization and variational techniques (65K10) Large-scale problems in mathematical programming (90C06) Stochastic programming (90C15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Recommendations
- A predictor-corrector method for extended linear-quadratic programming
- An interior-point method for a class of saddle-point problems
- An interior point method for constrained saddle point problems
- An interior point algorithm for computing saddle points of constrained continuous minimax
- An interior-point algorithm for nonlinear minimax problems
Cited in
(9)- Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
- An interior-point method for a class of saddle-point problems
- Two interior-point methods for nonlinear P_*()-complementarity problems.
- A predictor-corrector method for extended linear-quadratic programming
- An interior point parameterized central path following algorithm for linearly constrained convex programming
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- scientific article; zbMATH DE number 6692215 (Why is no real title available?)
- Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
This page was built for publication: A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337418)