15 citations · 33 across the 7 of their papers we have counts for
14 papers
Specification and Verification with the TLA+ Trifecta: TLC, Apalache, and TLAPS
Igor Konnov, Markus Kuppe, Stephan Merz
Using an algorithm due to Safra for distributed termination detection as a running example, we present the main tools for verifying specifications written in TLA+. Examining their…
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…
A Tendermint Light Client
Sean Braithwaite, Ethan Buchman, Ismail Khoffi +4
In Tendermint blockchains, the proof-of-stake mechanism and the underlying consensus algorithm entail a dynamic fault model that implies that the active validators (nodes that sign…
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…
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…
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…