"Time-varying convex optimization with O(n) computational complexity."

Mohammadreza Rostami, Solmaz S. Kia (2025)

> Home

Details and statistics

DOI: 10.1016/J.AUTOMATICA.2025.112355

access: closed

type: Journal Article

metadata version: 2025-09-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/automatica/RostamiK25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/automatica/RostamiK25
Mohammadreza Rostami, Solmaz S. Kia:
Time-varying convex optimization with O(n) computational complexity. Autom. 178: 112355 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.