Double-regularization proximal methods, with complementarity applications

DOI10.1007/s10589-005-3065-0zbMath1111.90111MaRDI QIDQ2506183

Jonathan Eckstein, Paulo J. S. Silva

Publication date: 28 September 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-005-3065-0

zbMATH Keywords

variational inequalities; complementarity; proximal algorithms

Mathematics Subject Classification ID

49J40: Variational inequalities

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Related Items

Proximal-like algorithm using the quasi D-function for convex second-order cone programming, Proximal methods for nonlinear programming: Double regularization and inexact subproblems, Rescaled proximal methods for linearly constrained convex problems

Uses Software

• KELLEY
• MCPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of the exponential multiplier method for convex programming
• Finite termination of the proximal point algorithm
• An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
• Approximate iterations in Bregman-function-based proximal algorithms
• A logarithmic-quadratic proximal method for variational inequalities
• Composition duality and maximal monotonicity
• Proximal minimization algorithm with \(D\)-functions
• Nonlinear rescaling vs. smoothing technique in convex optimization
• Smooth methods of multipliers for complementarity problems
• A class of smoothing functions for nonlinear and mixed complementarity problems
• On the twice differentiable cubic augmented Lagrangian
• Dual variational inequalities
• Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances
• Weak Sharp Minima in Mathematical Programming
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Full convergence of the steepest descent method with inexact line searches
• Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
• Convex Analysis
• Benchmarking optimization software with performance profiles.