A sequential parametric convex approximation method with applications to nonconvex truss topology design problems
By Amir Beck, Aharon Ben-Tal, Luba Tetruashvili. Journal of Global Optimization, 2010
592 citations recorded by the source corpus.
Subfields: Civil and Structural Engineering, Computational Theory and Mathematics, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/fd51d112a40e4c5609c29777511fc10b6876683c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Civil and Structural Engineering
- Yonina C. Eldar
- George K. Karagiannidis
- Zhiguo Ding
- Erik G. Larsson
- Stephen P. Boyd
- Muhammad Fainan Hanif
- T. Ratnarajah
- Sergiy A. Vorobyov
In Computational Theory and Mathematics
- Thomas Lipp
- Yonina C. Eldar
- Gesualdo Scutari
- Stephen P. Boyd
- Erik G. Larsson
- Francisco Facchinei
- Derrick Wing Kwan Ng
- Lorenzo Lampariello
In Industrial and Manufacturing Engineering
Citations in the corpus
- A Minorization-Maximization Method for Optimizing Sum Rate in the Downlink of Non-Orthogonal Multiple Access Systems (2015, methodology): “Under the different name of sequential convex programming a parametric approach has been proposed in [18].”
- Variations and extension of the convex–concave procedure (2016, background): “Also in structural engineering there is sequential parametric convex approximation (Beck et al, 2010).”
- Full-Duplex Communication for ISAC: Joint Beamforming and Power Optimization (2022, methodology): “After solving (42), we update ¯Q ( j ) , Ψ ( j ) , and { Φ a k } Kk =1 . point By iteratively solving (42) until convergence, KKT of (35) is obtained [34].”
- On the Total Energy Efficiency of Cell-Free Massive MIMO (2017, methodology): “Although, there is no guarantee that SCA-based method can yield an optimal solution in theory, our numerical results show that Algorithm 1 indeed converges to an optimal solution for small size networks in most cases.”
- Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory (2016, background): “Moreover, the solution of the subproblems is computable in closed form by each BS.”