activity
20122022
most citedCounter Attack on Byzantine Generals: Parameterized Model Checking of Fault-tolerant Distributed Algorithms

15 citations · 33 across the 7 of their papers we have counts for

collaborators
Showing math.OCShow all

10 papers · 1 filter

math.OC20222 cited

Primal-Dual Method for Optimization Problems with Changing Constraints

Igor Konnov

We propose a modified primal-dual method for general convex optimization problems with changing constraints. We obtain properties of Lagrangian saddle points for these problems whi…

math.OC20201 cited

Exact Penalties for Decomposable Optimization Problems

Igor V. Konnov

We consider a general decomposable convex optimization problem. By using right-hand side allocation technique, it can be transformed into a collection of small dimensional optimiza…

math.OC2020

Decentralized Multi-Agent Optimization Based on a Penalty Method

Igor Konnov

We propose a decentralized penalty method for general convex constrained multi-agent optimization problems. Each auxiliary penalized problem is solved approximately with a special…

math.OC2020

Variational Inequality Type Formulations of General Market Equilibrium Problems with Local Information

Igor Konnov

We suggest a new approach to creation of general market equilibrium models involving economic agents with local and partial knowledge about the system and under different restricti…

math.OC2020

A little about models

I. V. Konnov

We discuss several aspects of creation of adequate mathematical models in other sciences. In particular, many difficulties stem from great complexity of the source systems and the…

math.OC2020

A General Class of Relative Optimization Problems

I. V. Konnov

We consider relative or subjective optimization problems where the goal function and feasible set are dependent of the current state of the system under consideration. In general,…