( en | de | ru )

 

Disambiguation of "Porcelli, Margherita"

Author of the publication

copydeleteadd this publication to your clipboard
BFO, A Trainable Derivative-free Brute Force Optimizer for Nonlinear Bound-constrained Optimization and Equilibrium Computations with Continuous and Discrete Variables.

, and . ACM Trans. Math. Softw., 44 (1): 6:1-6:25 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Margherita Behn

Margherita Goltzsche

Margherita Brentano

Margherita Fabris

Margherita Barile

 

Other publications of authors with the same name

Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications., , and . Comput. Optim. Appl., 71 (1): 147-170 (2018)A Note on Using Performance and Data Profiles for Training Algorithms., and . ACM Trans. Math. Softw., 45 (2): 20:1-20:10 (2019)Numerical solution of a class of quasi-linear matrix equations., and . CoRR, (2022)A Tensor-Train Dictionary Learning algorithm based on Spectral Proximal Alternating Linearized Minimization., , and . CoRR, (2021)Exploiting Problem Structure in Derivative Free Optimization., and . ACM Trans. Math. Softw., 48 (1): 6:1-6:25 (2022)An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations., , , and . Comput. Optim. Appl., 84 (1): 191-223 (2023)Accelerated Algorithms For Nonlinear Matrix Decomposition With The Relu Function., , , , and . MLSP, page 1-6. IEEE, (2023)Preconditioning PDE-constrained optimization with L1-sparsity and control constraints., , and . Comput. Math. Appl., 74 (5): 1059-1075 (2017)BFO, A Trainable Derivative-free Brute Force Optimizer for Nonlinear Bound-constrained Optimization and Equilibrium Computations with Continuous and Discrete Variables., and . ACM Trans. Math. Softw., 44 (1): 6:1-6:25 (2017)A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion., , and . J. Sci. Comput., 89 (2): 46 (2021)