scientific article; zbMATH DE number 895356

zbMATH Open0847.90126MaRDI QIDQ4883368FDOQ4883368

Authors: Liqun Qi, Wenyu Sun 

Publication date: 13 October 1996

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 871324
• On the convergence of an iterative method for the minimax problem
• A smoothing iterative method for the finite minimax problem
• Iterative linear programming solution of convex programs

zbMATH Keywords

linear variational inequalityminimax problemlinear complementaritysequence of extended linear-quadratic programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational inequalities (49J40)

Cited In (12)

• A filter-trust-region method for LC 1 unconstrained optimization and its global convergence
• On distributionally robust multiperiod stochastic optimization
• A new non-monotone SQP algorithm for the minimax problem
• A scheme of iterative minimization methods
• Title not available (Why is that?)
• Newton's method and quasi-Newton-SQP method for general \(\text{LC}^1\) constrained optimization
• Quasi-Newton trust region algorithm for non-smooth least squares problems
• Two iterative algorithms for finding minimax solutions
• Method for the determination of the minimax
• Global convergence of nonmonotone descent methods for unconstrained optimization problems
• An active-set algorithm and a trust-region approach in constrained minimax problem
• A truncated aggregate smoothing Newton method for minimax problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883368)