Convex optimization problems with arbitrary right-hand side perturbations
A generalization of a primal-dual formulation of an optimization problem under arbitrary right-hand side perturbations is considered. A number of various equilibrium type problems are particular cases of this problem. The author reduces this problem to a class of variational inequalities. In general, such problems can be solved with the help of homotopy based methods. However, a general descent type method to find its solution has been proposed. If the primal cost function does not possess strengthened convexity properties, this descent method can be combined with a partial regularization method.
- On perturbations of certain nonconvex optimization problems
- Finite perturbation of convex programs
- Primal-dual solution perturbations in convex optimization
- Optimization of a convex program with a polynomial perturbation
- Convex Optimization Problems on Differentiable Sets
- scientific article; zbMATH DE number 3845356
- Constrained convex optimization problems-well-posedness and stability*
- Perturbing convex multiobjecttve programs
- scientific article; zbMATH DE number 4185402
- On solution sets for convex optimization problems
- Partial regularization and descent method for a extended primal-dual system
- Combined partial regularization and descent method for a generalized primal-dual system
- Nonmonotone equilibrium problems: Coercivity conditions and weak regularization
- Dual approach for a class of implicit convex optimization problems
- Dual gradient method with partial regularization for convex optimization problems
This page was built for publication: Convex optimization problems with arbitrary right-hand side perturbations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4675961)