Journal: Comp. Opt. and Appl.

Volume 73, Issue 3

707 -- 753Ernesto G. Birgin, José Mario Martínez. A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
755 -- 790Eike Börgens, Christian Kanzow. Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces
791 -- 819Martin Robinius, Lars Schewe, Martin Schmidt 0003, Detlef Stolten, Johannes Thürauf, Lara Welder. Robust optimal discrete arc sizing for tree-shaped potential networks
821 -- 837Axel Dreves. An algorithm for equilibrium selection in generalized Nash equilibrium problems
839 -- 869Dongying Wang, Xianfu Wang. A parameterized Douglas-Rachford algorithm
871 -- 901Feng Ma. On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
903 -- 912Yi Zhou, Yingbin Liang, Lixin Shen. A simple convergence analysis of Bregman proximal gradient algorithm
913 -- 932Dang Van Hieu, Pham Ky Anh, Le Dung Muu. Modified extragradient-like algorithms with new stepsizes for variational inequalities
933 -- 956Zhitao Xu, Li Gao. The Uzawa-MBB type algorithm for nonsymmetric saddle point problems
957 -- 996Songqiang Qiu. Convergence of a stabilized SQP method for equality constrained optimization
997 -- 1017Enrique Otárola, Richard Rankin, Abner J. Salgado. Maximum-norm a posteriori error estimates for an optimal control problem
1019 -- 0Zhi Wang, Kelvin Droegemeier, Luther W. White. Correction to: The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications

Volume 73, Issue 2

353 -- 386Peiran Yu, Ting Kei Pong. Iteratively reweighted \(\ell _1\) algorithms with extrapolation
387 -- 410Chin Pang Ho, Panos Parpas. Empirical risk minimization: probabilistic complexity and stepsize strategy
411 -- 452Andrea Cristofari. An almost cyclic 2-coordinate descent method for singly linearly constrained problems
453 -- 476Yu-Fan Li, Kun Shang, Zheng-Hai Huang. p-shrinkage thresholding algorithm for low rank matrix recovery
477 -- 508Juan Yin, Qingna Li. A semismooth Newton method for support vector classification and regression
509 -- 534Lina Abdallah, Mounir Haddou, Tangi Migot. A sub-additive DC approach to the complementarity problem
535 -- 574Luiz-Rafael Santos, Fernando R. Villas-Bôas, Aurelio R. L. Oliveira, Clovis Perin. Optimized choice of parameters in interior-point methods for linear programming
575 -- 601Lluís-Miquel Munguía, Geoffrey Oxberry, Deepak Rajan, Yuji Shinano. Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
603 -- 645Víctor Blanco. p-median problems with neighbourhoods
647 -- 677C. Yalçin Kaya. Markov-Dubins interpolating curves
679 -- 705Jean-Thomas Camino, Christian Artigues, Laurent Houssin, Stéphane Mourgues. Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design

Volume 73, Issue 1

1 -- 35Nicholas I. M. Gould, Tyrone Rees, Jennifer A. Scott. Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems
37 -- 67Peter J. C. Dickinson, Janez Povh. A new approximation hierarchy for polynomial conic optimization
69 -- 100Tianxiang Liu, Ting Kei Pong, Akiko Takeda. A refined convergence analysis of \(\hbox {pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
101 -- 128Luca Consolini, Mattia Laurini, Marco Locatelli 0001. Graph-based algorithms for the efficient solution of optimization problems involving monotone functions
129 -- 158Zhongming Wu, Min Li. General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
159 -- 199Yunmei Chen, Guanghui Lan, Yuyuan Ouyang, Wei Zhang. Fast bundle-level methods for unconstrained and ball-constrained convex optimization
201 -- 235William W. Hager, Hongchao Zhang. Inexact alternating direction methods of multipliers for separable convex optimization
237 -- 273Majela Pentón Machado. Projective method of multipliers for linearly constrained convex minimization
275 -- 310Sumit Kunnumkal, Kalyan T. Talluri. A strong Lagrangian relaxation for general discrete-choice network revenue management
311 -- 352Guoqiang Wang, Bo Yu. PAL-Hom method for QP and an application to LP