A tri-dimensional filter SQP algorithm for variational inequality problems

DOI10.1007/s40314-013-0036-4zbMath1280.65064OpenAlexW2022530223MaRDI QIDQ382458

Meiling Liu, Xue-Qian Li, Pu, Dingguo

Publication date: 19 November 2013

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-013-0036-4

zbMATH Keywords

global convergencenumerical resultssequential quadratic programmingvariational inequality problemsfilter techniquelarge scale problem

Mathematics Subject Classification ID

Variational inequalities (49J40) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55) Numerical methods for variational inequalities and related problems (65K15)

Related Items (1)

Strong convergence of a regularization algorithm for common solutions with applications

Uses Software

• Ipopt
• MCPLIB

Cites Work

• Unnamed Item
• Modified extragradient method for variational inequalities and verification of solution existence
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• A filter SQP algorithm without a feasibility restoration phase
• Global convergence of slanting filter methods for nonlinear programming
• A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs
• Global convergence of a tri-dimensional filter SQP algorithm based on the line search method
• Test examples for nonlinear programming codes
• Local analysis of Newton-type methods for variational inequalities and nonlinear programming
• A nonsmooth Newton method for variational inequalities. I: Theory
• Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
• On the superlinear local convergence of a filter-SQP method
• A class of projection and contraction methods for monotone variational inequalities
• A globally convergent Newton method for solving strongly monotone variational inequalities
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• A filter method for solving nonlinear complementarity problems
• A Sequential Linear Programming Algorithm for Solving Monotone Variational Inequalities
• Global Convergence of Filter Methods for Nonlinear Programming
• A New Projection Method for Variational Inequality Problems
• On the Global Convergence of a Filter--SQP Algorithm
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• A New Merit Function and a Successive Quadratic Programming Algorithm for Variational Inequality Problems
• Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
• Line Search Filter Methods for Nonlinear Programming: Local Convergence
• A Filter-Trust-Region Method for Unconstrained Optimization
• Nonlinear programming without a penalty function.

This page was built for publication: A tri-dimensional filter SQP algorithm for variational inequality problems