default search action
Computational Optimization and Applications, Volume 89
Volume 89, Number 1, September 2024
- Minda Zhao, Zehua Lai, Lek-Heng Lim:
Stochastic Steffensen method. 1-32 - Andreas Fischer, Alexey F. Izmailov, Mikhail V. Solodov:
The Levenberg-Marquardt method: an overview of modern convergence theories and more. 33-67 - Jean Bigeon, Sébastien Le Digabel, Ludovic Salomon:
Handling of constraints in multiobjective blackbox optimization. 69-113 - Bjørn Jensen, Tuomo Valkonen:
A nonsmooth primal-dual method with interwoven PDE constraint solver. 115-149 - Hugo Lara, Rafael Aleixo, Harry Oviedo:
Delayed Weighted Gradient Method with simultaneous step-sizes for strongly convex optimization. 151-182 - Hiroki Marumo, Sunyoung Kim, Makoto Yamashita:
T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization. 183-218 - Ting Zhang, Yong Wang, Zheng-Hai Huang:
Projected fixed-point method for vertical tensor complementarity problems. 219-245 - Natasa Krejic, Natasa Krklec Jerinkic, Angeles Martinez, Mahsa Yousefi:
A non-monotone trust-region method with noisy oracles and additional sampling. 247-278
Volume 89, Number 2, November 2024
- Clément W. Royer, Oumaima Sohab, Luís Nunes Vicente:
Full-low evaluation methods for bound and linearly constrained derivative-free optimization. 279-315 - Yiwen Chen, Warren L. Hare, Amy Wiebe:
Q-fully quadratic modeling and its application in a random subspace derivative-free method. 317-360 - Masaru Ito, Bruno F. Lourenço:
Eigenvalue programming beyond matrices. 361-384 - Serge Gratton, Valentin Mercier, Elisa Riccietti, Philippe L. Toint:
A block-coordinate approach of multi-level optimization with an application to physics-informed neural networks. 385-417 - Qinsi Wang, Wei Hong Yang:
An adaptive regularized proximal Newton-type methods for composite optimization over the Stiefel manifold. 419-457 - R. Díaz Millán, Orizon Pereira Ferreira, Julien Ugon:
Extragradient method with feasible inexact projection to variational inequality problem. 459-484 - Bin Zhou, Jie Jiang, Hailin Sun:
Dynamic stochastic projection method for multistage stochastic variational inequalities. 485-516 - Soumya Ranjan Pathy, Hamed Rahimian:
Value of risk aversion in perishable products supply chain management. 517-552 - Mark E. Cawood, P. M. Dearing:
The weighted Euclidean one-center problem in ${\mathbb {R}}^n$. 553-574 - Zichong Li, Pin-Yu Chen, Sijia Liu, Songtao Lu, Yangyang Xu:
Correction to: Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization. 575-578
Volume 89, Number 3, December 2024
- COAP 2023 best paper prize. 579-583
- Simeon vom Dahl, Christian Kanzow:
An inexact regularized proximal Newton method without line search. 585-624 - Jordan Leung, Frank Permenter, Ilya V. Kolmanovsky:
Inexact log-domain interior-point methods for quadratic programming. 625-658 - Nitesh Kumar Singh, Ion Necoara:
A stochastic moving ball approximation method for smooth convex constrained minimization. 659-689 - Marco Rando, Cesare Molinari, Silvia Villa, Lorenzo Rosasco:
Stochastic zeroth order descent with structured directions. 691-727 - Mehri Rashidi, Majid Soleimani-Damaneh:
MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization. 729-767 - Gabriel A. Carrizo, Nadia S. Fazzio, María Daniela Sánchez, María Laura Schuverdt:
Scaled-PAKKT sequential optimality condition for multiobjective problems and its application to an Augmented Lagrangian method. 769-803 - Qing-Rui He, Sheng-Jie Li, Bo-Ya Zhang, Chun-Rong Chen:
A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization. 805-842 - Chuan He, Heng Huang, Zhaosong Lu:
A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization. 843-894 - Xueli Bai, Dong-Hui Li, Lei Wu, Jiefeng Xu:
A power-like method for finding the spectral radius of a weakly irreducible nonnegative symmetric tensor. 895-926 - Kamiar Asgari, Michael J. Neely:
Nonsmooth projection-free optimization with functional constraints. 927-975 - Bo Rao, Liu Yang, Suhan Zhong, Guangming Zhou:
Robust approximation of chance constrained optimization with polynomial perturbation. 977-1003 - Bo Rao, Liu Yang, Suhan Zhong, Guangming Zhou:
Correction: Robust approximation of chance constrained optimization with polynomial perturbation. 1005-1006
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.