Showing 1 - 10 of 20
Lipschitz continuity of the gradient mapping of a continuously differentiable function plays a crucial role in designing various optimization algorithms. However, many functions arising in practical applications such as low rank matrix factorization or deep neural network problems do not have a...
Persistent link: https://www.econbiz.de/10014502010
We establish a region of convergence for the proto-typical non-convex Douglas–Rachford iteration which finds a point on the intersection of a line and a circle. Previous work on the non-convex iteration Borwein and Sims (Fixed-point algorithms for inverse problems in science and engineering,...
Persistent link: https://www.econbiz.de/10010994044
Many derivative-free methods for constrained problems are not efficient for minimizing functions on “thin” domains. Other algorithms, like those based on Augmented Lagrangians, deal with thin constraints using penalty-like strategies. When the constraints are computationally inexpensive but...
Persistent link: https://www.econbiz.de/10010994061
In this paper, based on the Robinson’s normal equation and the smoothing projection operator, a smoothing homotopy method is presented for solving variational inequality problems on polyhedral convex sets. We construct a new smoothing projection operator onto the polyhedral convex set, which...
Persistent link: https://www.econbiz.de/10010994066
Persistent link: https://www.econbiz.de/10009324642
Persistent link: https://www.econbiz.de/10009324679
The generalized Nash equilibrium is a Nash game, where not only the players’ cost functions, but also the constraints of a player depend on the rival players decisions. We present a globally convergent algorithm that is suited for the computation of a normalized Nash equilibrium in the...
Persistent link: https://www.econbiz.de/10010845850
Persistent link: https://www.econbiz.de/10010845856
In this paper, we investigate the use of DC (Difference of Convex functions) models and algorithms in the application of trust-region methods to the solution of a class of nonlinear optimization problems where the constrained set is closed and convex (and, from a practical point of view, where...
Persistent link: https://www.econbiz.de/10010793964
We present a new algorithm for solving equilibrium problems, where the underlying bifunctions are pseudomonotone and not necessarily Lipschitz-type continuous. The algorithm is based on the auxiliary problem principle and the Armijo-type linesearch techniques. Convergence properties of the...
Persistent link: https://www.econbiz.de/10010896431