default search action
Computational Optimization and Applications, Volume 68
Volume 68, Number 1, September 2017
- Benedetta Morini, Valeria Simoncini, Mattia Tani:
A comparison of reduced and unreduced KKT systems arising from interior point methods. 1-27 - M. Sayadi Shahraki, Hossein Mansouri, Maryam Zangiabadi:
Two wide neighborhood interior-point methods for symmetric cone optimization. 29-55 - Puya Latafat, Panagiotis Patrinos:
Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators. 57-93 - Xavier Bay, Laurence Grammont, Hassan Maatouk:
A new method for interpolating in a convex subset of a Hilbert space. 95-120 - Arnd Rösch, Kunibert G. Siebert, S. Steinig:
Reliable a posteriori error estimation for state-constrained optimal control. 121-162 - Ramsharan Rangarajan:
On the resolution of certain discrete univariate max-min problems. 163-192
Volume 68, Number 2, November 2017
- Adam N. Letchford, Qiang Ni, Zhaoyu Zhong:
An exact algorithm for a resource allocation problem in mobile wireless communications. 193-208 - Sebastiaan Breedveld, Bas van den Berg, Ben Heijmen:
An interior-point implementation developed and tuned for radiation therapy treatment planning. 209-242 - Georg Müller, Anton Schiela:
On the control of time discretized dynamic contact problems. 243-287 - Wei Kang, Lucas C. Wilcox:
Mitigating the curse of dimensionality: sparse grid characteristics method for optimal feedback control and HJB equations. 289-315 - Fabrice Poirion, Quentin Mercier, Jean-Antoine Désidéri:
Descent algorithm for nonsmooth stochastic multiobjective optimization. 317-331 - Lijun Xu, Bo Yu, Yin Zhang:
An alternating direction and projection algorithm for structure-enforced matrix factorization. 333-362 - Jonathan Eckstein, Wang Yao:
Approximate ADMM algorithms derived from Lagrangian splitting. 363-405 - Guoyin Li, Tianxiang Liu, Ting Kei Pong:
Peaceman-Rachford splitting for a class of nonconvex optimization problems. 407-436 - Yong Zhang, Wanzhou Ye, Jian-Jun Zhang:
A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery. 437-454 - Abdallah El Hamidi, H. Ossman, Mustapha Jazar:
On the convergence of alternating minimization methods in variational PGD. 455-472
Volume 68, Number 3, December 2017
- COAP 2016 Best Paper prize. 473-478
- Donald Goldfarb, Cun Mu, John Wright, Chaoxu Zhou:
Using negative curvature in solving nonlinear programs. 479-502 - Chengjing Wang, Peipei Tang:
A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming. 503-532 - El Houcine Bergou, Youssef Diouane, Serge Gratton:
On the use of the energy norm in trust-region and adaptive cubic regularization subproblems. 533-554 - Geovani Nunes Grapiglia, Ekkehard W. Sachs:
On the worst-case evaluation complexity of non-monotone line search algorithms. 555-577 - Xiao Wang, Shuxiong Wang, Hongchao Zhang:
Inexact proximal stochastic gradient method for convex composite optimization. 579-618 - Zhaosong Lu, Yong Zhang, Jian Lu:
\(\ell _p\) Regularized low-rank approximation via iterative reweighted singular value minimization. 619-642 - Mingqiang Li, Congying Han, Ruxin Wang, Tiande Guo:
Shrinking gradient descent algorithms for total variation regularized image denoising. 643-660 - André Berger, Alexander Grigoriev, Andrej Winokurow:
An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions. 661-669 - Peter A. Graf, Stephen C. Billups:
MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys. 671-687 - Simone Sagratella:
Algorithms for generalized potential games with mixed-integer variables. 689-717 - C. Yalçin Kaya:
Markov-Dubins path via optimal control theory. 719-747 - Mercedes Landete, Alfredo Marín, José L. Sainz-Pardo:
Decomposition methods based on articulation vertices for degree-dependent spanning tree problems. 749-773 - Jesús Sánchez-Oro, Anna Martínez-Gavara, Manuel Laguna, Rafael Martí, Abraham Duarte:
Variable neighborhood scatter search for the incremental graph drawing problem. 775-797
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.