Computational Optimization and Applications
2006 - 2023
Current editor(s): William W. Hager From Springer Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing (). Access Statistics for this journal.
Track citations for all items by RSS feed
Is something missing from the series or not right? See the RePEc data check for the archive and series.
Volume 69, issue 3, 2018
- A two-stage stochastic programming approach for influence maximization in social networks pp. 563-595

- Hao-Hsiang Wu and Simge Küçükyavuz
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates pp. 597-627

- Hiva Ghanbari and Katya Scheinberg
- A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties pp. 629-652

- Leonardo Galli, Christian Kanzow and Marco Sciandrone
- A two-level graph partitioning problem arising in mobile wireless communications pp. 653-676

- Jamie Fairbrother, Adam N. Letchford and Keith Briggs
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph pp. 677-712

- José F. S. Bravo Ferreira, Yuehaw Khoo and Amit Singer
- Decomposition methods for the two-stage stochastic Steiner tree problem pp. 713-752

- Markus Leitner, Ivana Ljubić, Martin Luipersbeck and Markus Sinnl
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation pp. 753-800

- Sara Mattia and Michael Poss
- Augmented Lagrangian and exact penalty methods for quasi-variational inequalities pp. 801-824

- Christian Kanzow and Daniel Steck
- Euler discretization for a class of nonlinear optimal control problems with control appearing linearly pp. 825-856

- Walter Alt, Ursula Felgenhauer and Martin Seydenschwanz
- An augmented Lagrange method for elliptic state constrained optimal control problems pp. 857-880

- Veronika Karl and Daniel Wachsmuth
Volume 69, issue 2, 2018
- An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints pp. 267-296

- G. Cocchi, G. Liuzzi, A. Papini and M. Sciandrone
- A proximal difference-of-convex algorithm with extrapolation pp. 297-324

- Bo Wen, Xiaojun Chen and Ting Kei Pong
- A globally convergent LP-Newton method for piecewise smooth constrained equations: escaping nonstationary accumulation points pp. 325-349

- A. Fischer, M. Herrich, A. F. Izmailov, W. Scheck and M. V. Solodov
- MINQ8: general definite and bound constrained indefinite quadratic programming pp. 351-381

- Waltraud Huyer and Arnold Neumaier
- A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane pp. 383-402

- Siamak Yousefi, Xiao-Wen Chang, Henk Wymeersch, Benoit Champagne and Godfried Toussaint
- Higher-order numerical scheme for linear quadratic problems with bang–bang controls pp. 403-422

- T. Scarinci and Vladimir Veliov
- A Fokker–Planck approach to control collective motion pp. 423-459

- Souvik Roy, Mario Annunziato, Alfio Borzì and Christian Klingenberg
- An efficient duality-based approach for PDE-constrained sparse optimization pp. 461-500

- Xiaoliang Song, Bo Chen and Bo Yu
- A study of the Bienstock–Zuckerberg algorithm: applications in mining and resource constrained project scheduling pp. 501-534

- Gonzalo Muñoz, Daniel Espinoza, Marcos Goycoolea, Eduardo Moreno, Maurice Queyranne and Orlando Rivera Letelier
- An efficient computational method for large scale surgery scheduling problems with chance constraints pp. 535-561

- Mahdi Noorizadegan and Abbas Seifi
Volume 69, issue 1, 2018
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs pp. 1-24

- Lluís-Miquel Munguía, Shabbir Ahmed, David A. Bader, George L. Nemhauser and Yufen Shao
- The geo-graph in practice: creating United States Congressional Districts from census blocks pp. 25-49

- D. M. King, S. H. Jacobson and E. C. Sewell
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points pp. 51-75

- E. G. Birgin, G. Haeser and A. Ramos
- An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization pp. 77-97

- Jianjun Liu, Xiangmin Xu and Xuehui Cui
- A new projection method for finding the closest point in the intersection of convex sets pp. 99-132

- Francisco J. Aragón Artacho and Rubén Campoy
- Copositive tensor detection and its applications in physics and hypergraphs pp. 133-158

- Haibin Chen, Zheng-Hai Huang and Liqun Qi
- The min-cut and vertex separator problem pp. 159-187

- Fanz Rendl and Renata Sotirov
- A multilevel bilinear programming algorithm for the vertex separator problem pp. 189-223

- William W. Hager, James T. Hungerford and Ilya Safro
- On exact linesearch quasi-Newton methods for minimizing a quadratic function pp. 225-241

- Anders Forsgren and Tove Odland
- Bounds for the solutions of absolute value equations pp. 243-266

- Milan Hladík
Volume 68, issue 3, 2017
- Using negative curvature in solving nonlinear programs pp. 479-502

- Donald Goldfarb, Cun Mu, John Wright and Chaoxu Zhou
- A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming pp. 503-532

- Chengjing Wang and Peipei Tang
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems pp. 533-554

- E. Bergou, Y. Diouane and S. Gratton
- On the worst-case evaluation complexity of non-monotone line search algorithms pp. 555-577

- Geovani N. Grapiglia and Ekkehard W. Sachs
- Inexact proximal stochastic gradient method for convex composite optimization pp. 579-618

- Xiao Wang, Shuxiong Wang and Hongchao Zhang
- $$\ell _p$$ ℓ p Regularized low-rank approximation via iterative reweighted singular value minimization pp. 619-642

- Zhaosong Lu, Yong Zhang and Jian Lu
- Shrinking gradient descent algorithms for total variation regularized image denoising pp. 643-660

- Mingqiang Li, Congying Han, Ruxin Wang and Tiande Guo
- An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions pp. 661-669

- André Berger, Alexander Grigoriev and Andrej Winokurow
- MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys pp. 671-687

- Peter A. Graf and Stephen Billups
- Algorithms for generalized potential games with mixed-integer variables pp. 689-717

- Simone Sagratella
- Markov–Dubins path via optimal control theory pp. 719-747

- C. Yalçın Kaya
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems pp. 749-773

- Mercedes Landete, Alfredo Marín and José Luis Sainz-Pardo
- Variable neighborhood scatter search for the incremental graph drawing problem pp. 775-797

- Jesús Sánchez-Oro, Anna Martínez-Gavara, Manuel Laguna, Rafael Martí and Abraham Duarte
Volume 68, issue 2, 2017
- An exact algorithm for a resource allocation problem in mobile wireless communications pp. 193-208

- Adam N. Letchford, Qiang Ni and Zhaoyu Zhong
- An interior-point implementation developed and tuned for radiation therapy treatment planning pp. 209-242

- Sebastiaan Breedveld, Bas Berg and Ben Heijmen
- On the control of time discretized dynamic contact problems pp. 243-287

- Georg Müller and Anton Schiela
- Mitigating the curse of dimensionality: sparse grid characteristics method for optimal feedback control and HJB equations pp. 289-315

- Wei Kang and Lucas C. Wilcox
- Descent algorithm for nonsmooth stochastic multiobjective optimization pp. 317-331

- Fabrice Poirion, Quentin Mercier and Jean-Antoine Désidéri
- An alternating direction and projection algorithm for structure-enforced matrix factorization pp. 333-362

- Lijun Xu, Bo Yu and Yin Zhang
- Approximate ADMM algorithms derived from Lagrangian splitting pp. 363-405

- Jonathan Eckstein and Wang Yao
- Peaceman–Rachford splitting for a class of nonconvex optimization problems pp. 407-436

- Guoyin Li, Tianxiang Liu and Ting Kei Pong
- A generalized elastic net regularization with smoothed $$\ell _{q}$$ ℓ q penalty for sparse vector recovery pp. 437-454

- Yong Zhang, Wanzhou Ye and Jianjun Zhang
- On the convergence of alternating minimization methods in variational PGD pp. 455-472

- A. El Hamidi, H. Ossman and M. Jazar
Volume 68, issue 1, 2017
- A comparison of reduced and unreduced KKT systems arising from interior point methods pp. 1-27

- Benedetta Morini, Valeria Simoncini and Mattia Tani
- Two wide neighborhood interior-point methods for symmetric cone optimization pp. 29-55

- M. Sayadi Shahraki, H. Mansouri and M. Zangiabadi
- Asymmetric forward–backward–adjoint splitting for solving monotone inclusions involving three operators pp. 57-93

- Puya Latafat and Panagiotis Patrinos
- A new method for interpolating in a convex subset of a Hilbert space pp. 95-120

- Xavier Bay, Laurence Grammont and Hassan Maatouk
- Reliable a posteriori error estimation for state-constrained optimal control pp. 121-162

- A. Rösch, K. G. Siebert and S. Steinig
- On the resolution of certain discrete univariate max–min problems pp. 163-192

- Ramsharan Rangarajan
| |