Interior Methods For a Class of Elliptic Variational Inequalities

We consider the applicat ion of primal-dual interior methods to the optimization of systems arising in the finite-element discretization of a class of elliptic variational inequalities. These problems lead to very large (possibly non-convex) optimization problems with upper and lower bound constraints.

[1]  G. M.,et al.  Partial Differential Equations I , 2023, Applied Mathematical Sciences.

[2]  M. J. D. Powell,et al.  Nonlinear Programming—Sequential Unconstrained Minimization Techniques , 1969 .

[3]  D. Bertsekas.  On the Goldstein-Levitin-Polyak gradient projection method , 1974, CDC 1974.

[4]  D. Kinderlehrer,et al.  An introduction to variational inequalities and their applications , 1980 .

[5]  D. Bertsekas.  Projected Newton methods for optimization problems with simple constraints , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[6]  S. Nash.  Newton-Type Minimization via the Lanczos Method , 1984 .

[7]  R. Glowinski,et al.  Numerical Methods for Nonlinear Variational Problems , 1985 .

[8]  Gerardo Toraldo,et al.  On the Solution of Large Quadratic Programming Problems with Bound Constraints , 1991, SIAM J. Optim..

[9]  R. Hoppe,et al.  Adaptive multilevel methods for obstacle problems , 1994 .

[10]  R. Kornhuber.  Monotone multigrid methods for elliptic variational inequalities I , 1994 .

[11]  R. Kornhuber.  Monotone multigrid methods for elliptic variational inequalities II , 1996 .

[12]  Thomas F. Coleman,et al.  An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds , 1993, SIAM J. Optim..

[13]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[14]  Zdenek Dostál,et al.  Box Constrained Quadratic Programming with Proportioning and Projections , 1997, SIAM J. Optim..

[15]  Anders Forsgren,et al.  Primal-Dual Interior Methods for Nonconvex Nonlinear Programming , 1998, SIAM J. Optim..

[16]  Randolph E. Bank,et al.  PLTMG - a software package for solving elliptic partial differential equations: users' guide 8.0 , 1998, Software, environments, tools.

[17]  C. T. Kelley,et al.  Estimates for the Nash-Sofer Preconditioner for the Reduced Hessian for Some Elliptic Variational Inequalities , 1999, SIAM J. Optim..

[18]  Stefan Ulbrich,et al.  Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption , 1999, Math. Program..

[19]  Nicholas I. M. Gould,et al.  Solving the Trust-Region Subproblem using the Lanczos Method , 1999, SIAM J. Optim..

[20]  Chih-Jen Lin,et al.  Newton's Method for Large Bound-Constrained Optimization Problems , 1999, SIAM J. Optim..

[21]  Thomas F. Coleman,et al.  A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems , 1999, SIAM J. Sci. Comput..

[22]  Randolph E. Bank,et al.  The Incomplete Factorization Multigraph Algorithm , 1999, SIAM J. Sci. Comput..

[23]  M. Heinkenschloss,et al.  Global Convergence of Trust-Region Interior-Point Algorithms for Infinite-Dimensional Nonconvex Mini , 1999 .

[24]  Jorge J. Moré,et al.  COPS: Large-scale nonlinearly constrained optimization problems , 2000 .

[25]  Stephen J. Wright.  On the convergence of the Newton/log-barrier method , 2001, Math. Program..

[26]  Jorge J. Moré,et al.  Benchmarking optimization software with performance profiles , 2001, Math. Program..