Dual approach for a class of implicit convex optimization problems
Considered is the class of implicit optimization problems with nonmonotone perturbations i.e. the problems of finding a pair of points \(( x^{\ast },y^{\ast }) \in X\times Y\) such that \[ f( x^{\ast }) +\langle y^{\ast },h( x^{\ast }) \rangle \leq f( x) +\langle y^{\ast },h( x) \rangle \;\;\forall x\in X,\eqno(1) \] \[ \langle b( y^{\ast }) -h( x^{\ast }) ,y-y^{\ast }\rangle \geq 0\;\;\forall y\in Y\eqno(2) \] where \(X\) is a nonempty, convex, and closed subset of the \(n\)-dimensional Euclidean space \(\mathbb{R}^{n};\;h:X\to \mathbb{R}^{m}\) a continuous mapping with convex continuous components \(h_{i}:X\to \mathbb{R}\) for \(i=1,\dots ,m;\) \( f:X\to \mathbb{R}\) a convex continuous function and \(Y\) is a nonempty, convex and closed subset of \(\mathbb{R}_{+}^{m}\). The author suggests the problem can be converted into a mixed variational inequality formulation of optimality conditions for a nonconvex and nonsmooth optimization pronlem which can be solved by splitting type methods. In the last section he considers some additional examples of equilibrium type problems which can be viewed as particular cases of the system (1),(2).
- Convex optimization problems with arbitrary right-hand side perturbations
- Improving the solution of variational inequalities based on the optimization approach
- scientific article; zbMATH DE number 2205686
- System of implicit nonconvex variational inequality problems: a projection method approach
- Splitting-type method for systems of variational inequalities
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- On implementation of a self-dual embedding method for convex programming
- Partial regularization and descent method for a extended primal-dual system
- Combined partial regularization and descent method for a generalized primal-dual system
- Combined methods for dynamic spatial auction market models
- Explicit model of dual programming and solving method for a class of separable convex programming problems
- Nonmonotone equilibrium problems: Coercivity conditions and weak regularization
- On implicit variables in optimization theory
- Nonlinear extended variational inequalities without differentiability: Applications and solution methods
- Duality for almost convex optimization problems via the perturbation approach
This page was built for publication: Dual approach for a class of implicit convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706374)
