Stop the war!
Остановите войну!
for scientists:
default search action
Computational Optimization and Applications, Volume 81
Volume 81, Number 1, January 2022
- José Mario Martínez, Lúcio Tunes Santos:
On large-scale unconstrained optimization and arbitrary regularization. 1-30 - Tong Chen, Jean-Bernard Lasserre, Victor Magron, Edouard Pauwels:
A sublevel moment-SOS hierarchy for polynomial optimization. 31-66 - Bin Gao, Pierre-Antoine Absil:
A Riemannian rank-adaptive method for low-rank matrix completion. 67-90 - Orizon Pereira Ferreira, Max Lemes, Leandro da Fonseca Prudente:
On the inexact scaled gradient projection method. 91-125 - Xin Jiang, Lieven Vandenberghe:
Bregman primal-dual first-order method and application to sparse semidefinite programming. 127-159 - Na Huang:
On R-linear convergence analysis for a class of gradient methods. 161-177 - Kwassi Joseph Dzahini:
Expected complexity analysis of stochastic direct-search. 179-200 - Murwan Siddig, Yongjia Song:
Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse. 201-250 - Alessandro Scagliotti, Piero Colli Franzone:
A piecewise conservative method for unconstrained convex optimization. 251-288 - Heinz H. Bauschke, Shambhavi Singh, Xianfu Wang:
Finding best approximation pairs for two intersections of closed convex sets. 289-308 - Michael Haythorpe, Walter Murray:
Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem. 309-336
Volume 81, Number 2, March 2022
- Liaoyuan Zeng, Ting Kei Pong:
ρ-regularization subproblems: strong duality and an eigensolver-based algorithm. 337-368 - Alberto De Marchi:
On a primal-dual Newton proximal method for convex quadratic programs. 369-395 - Yuya Yamakawa, Hiroyuki Sato:
Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method. 397-421 - Meenarli Sharma, Prashant Palkar, Ashutosh Mahajan:
Linearization and parallelization schemes for convex mixed-integer nonlinear optimization. 423-478 - Jianchao Bai, William W. Hager, Hongchao Zhang:
An inexact accelerated stochastic ADMM for separable convex optimization. 479-518 - Quan Yu, Xinzhen Zhang:
A smoothing proximal gradient algorithm for matrix rank minimization problem. 519-538 - Xiubo Liang, Guoqiang Wang, Bo Yu:
A reduced proximal-point homotopy method for large-scale non-convex BQP. 539-567 - Barbara Kaltenbacher, Kha Van Huynh:
Iterative regularization for constrained minimization formulations of nonlinear inverse problems. 569-611 - Fanrong Xie, Anuj Sharma, Zuoan Li:
An alternate approach to solve two-level priority based assignment problem. 613-656 - Sergio Cavero, Eduardo G. Pardo, Abraham Duarte:
A general variable neighborhood search for the cyclic antibandwidth problem. 657-687
Volume 81, Number 3, April 2022
- Ernesto G. Birgin, José Mario Martínez:
Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients. 689-715 - Yakui Huang, Yu-Hong Dai, Xin-Wei Liu, Hongchao Zhang:
On the acceleration of the Barzilai-Borwein method. 717-740 - Dominique Monnet, Warren L. Hare, Yves Lucet:
A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design. 741-767 - Viviana A. Ramirez, Graciela N. Sottosanto:
Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems. 769-788 - Christian von Lücken, Carlos A. Brizuela, Benjamín Barán:
Clustering-based multipopulation approaches in MOEA/D for many-objective problems. 789-828 - Donghui Li, Xiaozhou Wang, Jiajian Huang:
Diagonal BFGS updates and applications to the limited memory BFGS method. 829-856 - Elisha R. Pager, Anil V. Rao:
Method for solving bang-bang and singular optimal control problems using adaptive Radau collocation. 857-887 - Mengya Feng, Tongjun Sun:
A priori error estimate of perturbation method for optimal control problem governed by elliptic PDEs with small uncertainties. 889-921 - Pengfei Huang, Qingzhi Yang, Yuning Yang:
Finding the global optimum of a class of quartic minimization problem. 923-954
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.