( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Existence and symmetry of minimax regression designs

, и . Journal of Statistical Planning and Inference, 137 (1): 344--354 (01.01.2007)

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.

Christoph Janello

Wertschöpfung im digitalisierten Buchmarkt. Uni München, (2010)

Eckhard Janeba

Aneta Janecki

Johannes Janetzkowski

Verena Jänen

 

Другие публикации лиц с тем же именем

Existence and symmetry of minimax regression designs, и . Journal of Statistical Planning and Inference, 137 (1): 344--354 (01.01.2007)First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints., и . SIAM J. Optim., 26 (4): 2820-2846 (2016)Minimizing the Condition Number to Construct Design Points for Polynomial Regression Models., и . SIAM J. Optim., 23 (1): 666-686 (2013)Bilevel Polynomial Programs and Semidefinite Relaxation Methods., , и . SIAM J. Optim., 27 (3): 1728-1757 (2017)Difference of convex algorithms for bilevel programs with applications in hyperparameter selection., , , и . Math. Program., 198 (2): 1583-1616 (апреля 2023)Optimality Conditions and Exact Penalty for Mathematical Programs with Switching Constraints., и . J. Optim. Theory Appl., 190 (1): 1-31 (2021)Value Function based Difference-of-Convex Algorithm for Bilevel Hyperparameter Selection Problems., , , , и . ICML, том 162 из Proceedings of Machine Learning Research, стр. 7164-7182. PMLR, (2022)Generalized Bellman-Hamilton-Jacobi equations for piecewise deterministic Markov processes.. System Modelling and Optimization, том 197 из Lecture Notes in Control and Information Sciences, стр. 539-550. Springer, (1993)New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches., и . SIAM J. Optim., 20 (4): 1885-1905 (2010)An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming., , , и . SIAM J. Numer. Anal., 55 (1): 168-193 (2017)