Double-regularization proximal methods, with complementarity applications
From MaRDI portal
Publication:2506183
DOI10.1007/s10589-005-3065-0zbMath1111.90111MaRDI QIDQ2506183
Paulo J. S. Silva, Jonathan Eckstein
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
49J40: Variational inequalities
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
A proximal method with logarithmic barrier for nonlinear complementarity problems, Interior proximal method without the cutting plane property, Proximal-like algorithm using the quasi D-function for convex second-order cone programming, Proximal methods for nonlinear programming: Double regularization and inexact subproblems, Generalized Proximal Distances for Bilevel Equilibrium Problems, Convergence rate of a proximal multiplier algorithm for separable convex minimization, Rescaled proximal methods for linearly constrained convex problems
Uses Software
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.
