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 71, issue 3, 2018
- A specialized primal-dual interior point method for the plastic truss layout optimization pp. 613-640

- Alemseged Gebrehiwot Weldeyesus and Jacek Gondzio
- Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case pp. 641-671

- Aimé Kamgaing Kuiteing, Patrice Marcotte and Gilles Savard
- A fast gradient and function sampling method for finite-max functions pp. 673-717

- Elias S. Helou, Sandra A. Santos and Lucas E. A. Simões
- A new reduced gradient method for solving linearly constrained multiobjective optimization problems pp. 719-741

- Mustapha El Moudden and Ahmed El Ghali
- On inexact ADMMs with relative error criteria pp. 743-765

- Jiaxin Xie
- Proximal primal–dual best approximation algorithm with memory pp. 767-794

- E. M. Bednarczuk, A. Jezierska and K. E. Rutkowski
- A majorization–minimization algorithm for split feasibility problems pp. 795-828

- Jason Xu, Eric C. Chi, Meng Yang and Kenneth Lange
- An exact and heuristic approach for the d-minimum branch vertices problem pp. 829-855

- Jorge Moreno, Yuri Frota and Simone Martins
- Error estimates for the approximation of multibang control problems pp. 857-878

- Christian Clason, Thi Bich Tram Do and Frank Pörner
- A convergence analysis of the method of codifferential descent pp. 879-913

- M. V. Dolgopolik
Volume 71, issue 2, 2018
- A progressive barrier derivative-free trust-region algorithm for constrained optimization pp. 307-329

- Charles Audet, Andrew R. Conn, Sébastien Le Digabel and Mathilde Peyrega
- Mesh-based Nelder–Mead algorithm for inequality constrained optimization pp. 331-352

- Charles Audet and Christophe Tribes
- A penalty method for rank minimization problems in symmetric matrices pp. 353-380

- Xin Shen and John E. Mitchell
- A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities pp. 381-402

- Yang Zhan and Chuangyin Dang
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach pp. 403-433

- Yoshihiro Kanno
- Duality of nonconvex optimization with positively homogeneous functions pp. 435-456

- Shota Yamanaka and Nobuo Yamashita
- Exact augmented Lagrangian functions for nonlinear semidefinite programming pp. 457-482

- Ellen H. Fukuda and Bruno F. Lourenço
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier pp. 483-508

- Petra Renáta Rigó and Zsolt Darvay
- Finding a best approximation pair of points for two polyhedra pp. 509-523

- Ron Aharoni, Yair Censor and Zilin Jiang
- A two-level metaheuristic for the all colors shortest path problem pp. 525-551

- F. Carrabs, R. Cerulli, R. Pentangelo and A. Raiconi
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches pp. 553-608

- Guanglei Wang and Hassan Hijazi
Volume 71, issue 1, 2018
- Introduction to the special issue for SIMAI 2016 pp. 1-3

- Valeria Ruggiero and Gerardo Toraldo
- A block coordinate variable metric linesearch based proximal gradient method pp. 5-52

- S. Bonettini, M. Prato and S. Rebegoldi
- A multi-objective DIRECT algorithm for ship hull optimization pp. 53-72

- E. F. Campana, M. Diez, G. Liuzzi, S. Lucidi, R. Pellegrini, V. Piccialli, F. Rinaldi and A. Serani
- Planar methods and grossone for the Conjugate Gradient breakdown in nonlinear programming pp. 73-93

- Renato De Leone, Giovanni Fasano and Yaroslav D. Sergeyev
- Modified Fejér sequences and applications pp. 95-113

- Junhong Lin, Lorenzo Rosasco, Silvia Villa and Ding-Xuan Zhou
- Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training pp. 115-145

- Andrea Manno, Laura Palagi and Simone Sagratella
- Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications pp. 147-170

- Leopoldo Marini, Benedetta Morini and Margherita Porcelli
- Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm pp. 171-191

- E. Loli Piccolomini, V. L. Coli, E. Morotti and L. Zanni
- Algorithms for positive semidefinite factorization pp. 193-219

- Arnaud Vandaele, François Glineur and Nicolas Gillis
- A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization pp. 221-250

- Norikazu Takahashi, Jiro Katayama, Masato Seki and Jun’ichi Takeuchi
- An effective adaptive trust region algorithm for nonsmooth minimization pp. 251-271

- Zhou Sheng and Gonglin Yuan
- A non-overlapping DDM combined with the characteristic method for optimal control problems governed by convection–diffusion equations pp. 273-306

- Tongjun Sun and Keying Ma
Volume 70, issue 3, 2018
- Combinatorial optimal control of semilinear elliptic PDEs pp. 641-675

- Christoph Buchheim, Renke Kuhlmann and Christian Meyer
- Optimal control of a class of reaction–diffusion systems pp. 677-707

- Eduardo Casas, Christopher Ryll and Fredi Tröltzsch
- Proximal algorithms and temporal difference methods for solving fixed point problems pp. 709-736

- Dimitri P. Bertsekas
- A generalized projection-based scheme for solving convex constrained optimization problems pp. 737-762

- Aviv Gibali, Karl-Heinz Küfer, Daniel Reem and Philipp Süss
- Complexity of the relaxed Peaceman–Rachford splitting method for the sum of two maximal strongly monotone operators pp. 763-790

- Renato D. C. Monteiro and Chee-Khian Sim
- A class of ADMM-based algorithms for three-block separable convex programming pp. 791-826

- Bingsheng He and Xiaoming Yuan
- The generalized proximal point algorithm with step size 2 is not necessarily convergent pp. 827-839

- Min Tao and Xiaoming Yuan
- A convergent relaxation of the Douglas–Rachford algorithm pp. 841-863

- Nguyen Hieu Thao
- On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems pp. 865-888

- Laureano F. Escudero, María Araceli Garín, Celeste Pizarro and Aitziber Unzueta
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem pp. 889-910

- Ewa M. Bednarczuk, Janusz Miroforidis and Przemysław Pyzel
Volume 70, issue 2, 2018
- Parallel cyclic reduction strategies for linear systems that arise in dynamic optimization problems pp. 321-350

- Bethany L. Nicholson, Wei Wan, Shivakumar Kameswaran and Lorenz T. Biegler
- A flexible coordinate descent method pp. 351-394

- Kimon Fountoulakis and Rachael Tappenden
- A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis pp. 395-418

- Hao Jiang, Daniel P. Robinson, René Vidal and Chong You
- Completely positive tensor recovery with minimal nuclear value pp. 419-441

- Anwa Zhou and Jinyan Fan
- A primal-dual homotopy algorithm for $$\ell _{1}$$ ℓ 1 -minimization with $$\ell _{\infty }$$ ℓ ∞ -constraints pp. 443-478

- Christoph Brauer, Dirk A. Lorenz and Andreas M. Tillmann
- Chance-constrained economic dispatch with renewable energy and storage pp. 479-502

- Jianqiang Cheng, Richard Li-Yang Chen, Habib N. Najm, Ali Pinar, Cosmin Safta and Jean-Paul Watson
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization pp. 503-530

- Martin Branda, Max Bucher, Michal Červinka and Alexandra Schwartz
- Adaptive optimal control of Signorini’s problem pp. 531-569

- Andreas Rademacher and Korinna Rosin
- Efficiently solving total least squares with Tikhonov identical regularization pp. 571-592

- Meijia Yang, Yong Xia, Jiulin Wang and Jiming Peng
- A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions pp. 593-613

- Tasnuva Haque and Yves Lucet
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms pp. 615-639

- Gabriel Haeser
Volume 70, issue 1, 2018
- Real eigenvalues of nonsymmetric tensors pp. 1-32

- Jiawang Nie and Xinzhen Zhang
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides pp. 33-59

- Guanglin Xu and Samuel Burer
- Time-optimal velocity planning by a bound-tightening technique pp. 61-90

- Federico Cabassi, Luca Consolini and Marco Locatelli
- Accelerated primal–dual proximal block coordinate updating methods for constrained convex optimization pp. 91-128

- Yangyang Xu and Shuzhong Zhang
- Generalized symmetric ADMM for separable convex optimization pp. 129-170

- Jianchao Bai, Jicheng Li, Fengmin Xu and Hongchao Zhang
- Two smooth support vector machines for $$\varepsilon $$ ε -insensitive regression pp. 171-199

- Weizhe Gu, Wei-Po Chen, Chun-Hsu Ko, Yuh-Jye Lee and Jein-Shan Chen
- Iterative reweighted methods for $$\ell _1-\ell _p$$ ℓ 1 - ℓ p minimization pp. 201-219

- Xianchao Xiu, Lingchen Kong, Yan Li and Houduo Qi
- On the convergence of the gradient projection method for convex optimal control problems with bang–bang solutions pp. 221-238

- J. Preininger and P. T. Vuong
- Improved approximation rates for a parabolic control problem with an objective promoting directional sparsity pp. 239-266

- Eduardo Casas, Mariano Mateos and Arnd Rösch
- MIP-based instantaneous control of mixed-integer PDE-constrained gas transport problems pp. 267-294

- Martin Gugat, Günter Leugering, Alexander Martin, Martin Schmidt, Mathias Sirvent and David Wintergerst
- Tikhonov regularization of control-constrained optimal control problems pp. 295-320

- Nikolaus Daniels
| |