Uncontrolled inexact information within bundle methods
We consider convex non-smooth optimization problems where additional information with uncontrolled accuracy is readily available. It is often the case when the objective function is itself the output of an optimization solver, as for large-scale energy ...
Jérôme Malick +2 more
doaj +1 more source
Split equality variational inequality problems for pseudomonotone mappings in Banach spaces
A new algorithm for approximating solutions of the split equality variational inequality problems (SEVIP) for pseudomonotone mappings in the setting of Banach spaces is introduced. Strong convergence of the sequence generated by the proposed algorithm to
BOIKANYO, Oganeditse A., ZEGEYE, Habtu
core +1 more source
Proximal methods for a class of bilevel monotone equilibrium problems
Bilevel problem, Variational inequality, Monotonicity, Equilibrium problem, Proximal method, 90C25, 49M45, 65C25,
Abdellatif Moudafi, Moudafi, Abdellatif
core +1 more source
DrAmpl: a meta solver for optimization problem analysis
Optimization model, AMPL modeling language, Directed acyclic graph, Convexity assessment, Structural model analysis, Solver recommendation, C61, C63, 90C25, 90C26, 90C30,
Dominique Orban +3 more
core +1 more source
A relaxed version of the gradient projection method for variational inequalities with applications
In this paper, we propose a relaxed version of the gradient projection method for strongly monotone variational inequalities defined on a level set of a (possibly non-differentiable) convex function.
THE VINH, Nguyen, THI THUONG, Ngo
core +1 more source
Cascading: an adjusted exchange method for robust conic programming
Robust programming, Conic programming, Semi-infinite programming, Exchange method, 90C34, 90C25,
Ralf Werner, Werner, Ralf, Werner, R.
core +1 more source
Two Relaxed Inertial Forward–Reflected–Backward Splitting Algorithms With Momentum Terms
In this paper, to solve the monotone inclusion problem consisting of the sum of two monotone operators in Hilbert spaces, we propose and study two modifications of Malitsky–Tam’s forward–reflection–backward splitting methods with double momentum terms. Meanwhile, we consider a relaxed inertial version to expand the range of allowable step sizes.
Binbin Zhang +3 more
wiley +1 more source
Algebraic and metric structures of the geometric mean cone
The geometric mean cone (GMC) is a higher-order generalization of the second-order cone and the rotated quadratic cone. While these lower-order cones admit well-established Euclidean Jordan algebraic representations, no analogous framework is currently ...
Alzalg Baha
doaj +1 more source
Generalized derivatives and nonsmooth optimization, a finite dimensional tour
Convex optimization, nonsmooth analysis, nonsmooth optimization, set-valued maps, variational analysis, mathematical programming, nonconvex programming, nonlinear programming, optimality conditions, second order conditions, tangent cones, normal cones ...
Joydeep Dutta
core +1 more source
The robust isolated calmness of spectral norm regularized convex matrix optimization problems
This article aims to provide a series of characterizations of the robust isolated calmness of the Karush-Kuhn-Tucker (KKT) mapping for spectral norm regularized convex optimization problems. By establishing the variational properties of the spectral norm
Yin Ziran, Chen Xiaoyu, Zhang Jihong
doaj +1 more source

