Dual approach for a class of implicit convex optimization problems

DOI10.1007/S001860300337MaRDI QIDQ706374zbMATHOpenAlexFDO

Authors Igor V. Konnov

Publication date 8 February 2005

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s001860300337

zbMATH Keywords

nonmonotone perturbations

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Convex optimization problems with arbitrary right-hand side perturbations
• Improving the solution of variational inequalities based on the optimization approach
• Publication:5317002
• System of implicit nonconvex variational inequality problems: a projection method approach
• Splitting-type method for systems of variational inequalities

Cited in

(10)

• Nonmonotone equilibrium problems: Coercivity conditions and weak regularization
• Combined methods for dynamic spatial auction market models
• Combined partial regularization and descent method for a generalized primal-dual system
• Explicit model of dual programming and solving method for a class of separable convex programming problems
• Duality for almost convex optimization problems via the perturbation approach
• Partial regularization and descent method for a extended primal-dual system
• 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
• On implicit variables in optimization theory
• Nonlinear extended variational inequalities without differentiability: Applications and solution methods

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)