default search action
Computational Optimization and Applications, Volume 73
Volume 73, Number 1, May 2019
- Nicholas I. M. Gould
, Tyrone Rees
Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems. 1-35 - Peter J. C. Dickinson, Janez Povh
A new approximation hierarchy for polynomial conic optimization. 37-67 - Tianxiang Liu
A refined convergence analysis of \(\hbox {pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection. 69-100 - Luca Consolini, Mattia Laurini
Graph-based algorithms for the efficient solution of optimization problems involving monotone functions. 101-128 - Zhongming Wu, Min Li:
General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems. 129-158 - Yunmei Chen
Fast bundle-level methods for unconstrained and ball-constrained convex optimization. 159-199 - William W. Hager, Hongchao Zhang:
Inexact alternating direction methods of multipliers for separable convex optimization. 201-235 - Majela Pentón Machado
Projective method of multipliers for linearly constrained convex minimization. 237-273 - Sumit Kunnumkal, Kalyan T. Talluri
A strong Lagrangian relaxation for general discrete-choice network revenue management. 275-310 - Guoqiang Wang, Bo Yu:
PAL-Hom method for QP and an application to LP. 311-352
Volume 73, Number 2, June 2019
- Peiran Yu, Ting Kei Pong
Iteratively reweighted \(\ell _1\) algorithms with extrapolation. 353-386 - Chin Pang Ho
Empirical risk minimization: probabilistic complexity and stepsize strategy. 387-410 - Andrea Cristofari
An almost cyclic 2-coordinate descent method for singly linearly constrained problems. 411-452 - Yu-Fan Li, Kun Shang
A singular value p-shrinkage thresholding algorithm for low rank matrix recovery. 453-476 - Juan Yin
A semismooth Newton method for support vector classification and regression. 477-508 - Lina Abdallah, Mounir Haddou, Tangi Migot
A sub-additive DC approach to the complementarity problem. 509-534 - Luiz-Rafael Santos
Optimized choice of parameters in interior-point methods for linear programming. 535-574 - Lluís-Miquel Munguía
Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs. 575-601 - Víctor Blanco
Ordered p-median problems with neighbourhoods. 603-645 - C. Yalçin Kaya
Markov-Dubins interpolating curves. 647-677 - Jean-Thomas Camino, Christian Artigues, Laurent Houssin
Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design. 679-705
Volume 73, Number 3, July 2019
- Ernesto G. Birgin
A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization. 707-753 - Eike Börgens, Christian Kanzow
Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces. 755-790 - Martin Robinius
Robust optimal discrete arc sizing for tree-shaped potential networks. 791-819 - Axel Dreves
An algorithm for equilibrium selection in generalized Nash equilibrium problems. 821-837 - Dongying Wang, Xianfu Wang:
A parameterized Douglas-Rachford algorithm. 839-869 - Feng Ma
On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective. 871-901 - Yi Zhou
A simple convergence analysis of Bregman proximal gradient algorithm. 903-912 - Dang Van Hieu
Modified extragradient-like algorithms with new stepsizes for variational inequalities. 913-932 - Zhitao Xu
The Uzawa-MBB type algorithm for nonsymmetric saddle point problems. 933-956 - Songqiang Qiu
Convergence of a stabilized SQP method for equality constrained optimization. 957-996 - Enrique Otárola
Maximum-norm a posteriori error estimates for an optimal control problem. 997-1017 - Zhi Wang, Kelvin Droegemeier, Luther W. White:
Correction to: The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications. 1019
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.
last updated on 2024-12-29 01:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: