Printed from https://ideas.repec.org/s/spr/coopap5.html
Content
September 2017, Volume 68, Issue 1
- 57-93 Asymmetric forward–backward–adjoint splitting for solving monotone inclusions involving three operators
by Puya Latafat & Panagiotis Patrinos - 95-120 A new method for interpolating in a convex subset of a Hilbert space
by Xavier Bay & Laurence Grammont & Hassan Maatouk - 121-162 Reliable a posteriori error estimation for state-constrained optimal control
by A. Rösch & K. G. Siebert & S. Steinig - 163-192 On the resolution of certain discrete univariate max–min problems
by Ramsharan Rangarajan
July 2017, Volume 67, Issue 3
- 443-487 Forward–backward quasi-Newton methods for nonsmooth optimization problems
by Lorenzo Stella & Andreas Themelis & Panagiotis Patrinos - 489-520 Further properties of the forward–backward envelope with applications to difference-of-convex programming
by Tianxiang Liu & Ting Kei Pong - 521-541 Total variation image deblurring with space-varying kernel
by Daniel O’Connor & Lieven Vandenberghe - 543-569 $$S_{1/2}$$ S 1 / 2 regularization methods and fixed point algorithms for affine rank minimization problems
by Dingtao Peng & Naihua Xiu & Jian Yu - 571-594 New subgradient extragradient methods for common solutions to equilibrium problems
by Dang Hieu - 595-620 Generalized Krasnoselskii–Mann-type iterations for nonexpansive mappings in Hilbert spaces
by Christian Kanzow & Yekini Shehu
June 2017, Volume 67, Issue 2
- 225-258 Second-order orthant-based methods with enriched Hessian information for sparse $$\ell _1$$ ℓ 1 -optimization
by J. C. De Los Reyes & E. Loayza & P. Merino - 259-292 Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
by Patrick R. Johnstone & Pierre Moulin - 293-316 Branch-and-price for p-cluster editing
by Teobaldo Bulhões & Anand Subramanian & Gilberto F. Sousa Filho & Lucídio dos Anjos F. Cabral - 317-360 Solving nearly-separable quadratic optimization problems as nonsmooth equations
by Frank E. Curtis & Arvind U. Raghunathan - 361-399 An SQP method for mathematical programs with vanishing constraints with strong convergence properties
by Matúš Benko & Helmut Gfrerer - 401-419 $$L^1$$ L 1 penalization of volumetric dose objectives in optimal control of PDEs
by Richard C. Barnard & Christian Clason - 421-442 Visualization of the $$\varepsilon $$ ε -subdifferential of piecewise linear–quadratic functions
by Anuj Bajaj & Warren Hare & Yves Lucet
May 2017, Volume 67, Issue 1
- 1-38 A dual gradient-projection method for large-scale strictly convex quadratic problems
by Nicholas I. M. Gould & Daniel P. Robinson - 39-71 Error estimates for integral constraint regularization of state-constrained elliptic control problems
by B. Jadamba & A. Khan & M. Sama - 73-110 A Riemannian conjugate gradient method for optimization on the Stiefel manifold
by Xiaojing Zhu - 111-127 A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods
by Porfirio Suñagua & Aurelio R. L. Oliveira - 129-154 Subspace-stabilized sequential quadratic programming
by A. F. Izmailov & E. I. Uskov - 155-173 On merit functions for p-order cone complementarity problem
by Xin-He Miao & Yu-Lin Chang & Jein-Shan Chen - 175-199 Analysis on Newton projection method for the split feasibility problem
by Biao Qu & Changyu Wang & Naihua Xiu - 201-223 Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks
by Filippo Pecci & Edo Abraham & Ivan Stoianov
April 2017, Volume 66, Issue 3
- 401-424 Structured regularization for barrier NLP solvers
by Wei Wan & Lorenz T. Biegler - 425-451 Adaptive smoothing algorithms for nonsmooth composite convex minimization
by Quoc Tran-Dinh - 453-479 A robust Lagrangian-DNN method for a class of quadratic optimization problems
by Naohiko Arima & Sunyoung Kim & Masakazu Kojima & Kim-Chuan Toh - 481-505 Partitioned quasi-Newton methods for sparse nonlinear equations
by Hui-Ping Cao & Dong-Hui Li - 507-532 A nonmonotone Jacobian smoothing inexact Newton method for NCP
by Sanja Rapajić & Zoltan Papp - 533-556 Quasi-Newton smoothed functional algorithms for unconstrained and constrained simulation optimization
by K. Lakshmanan & Shalabh Bhatnagar - 557-576 Formulating an n-person noncooperative game as a tensor complementarity problem
by Zheng-Hai Huang & Liqun Qi - 577-600 A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
by Ali Mohammad-Nezhad & Tamás Terlaky
March 2017, Volume 66, Issue 2
- 223-244 Local nonglobal minima for solving large-scale extended trust-region subproblems
by Maziar Salahi & Akram Taati & Henry Wolkowicz - 245-266 On solving L-SR1 trust-region subproblems
by Johannes Brust & Jennifer B. Erway & Roummel F. Marcia - 267-283 A semidefinite algorithm for completely positive tensor decomposition
by Jinyan Fan & Anwa Zhou - 285-307 Computing the generalized eigenvalues of weakly symmetric tensors
by Na Zhao & Qingzhi Yang & Yajun Liu - 309-326 Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
by Meijiao Liu & Yong-Jin Liu - 327-343 A note on the convergence of ADMM for linearly constrained convex optimization problems
by Liang Chen & Defeng Sun & Kim-Chuan Toh - 345-381 Decomposable norm minimization with proximal-gradient homotopy algorithm
by Reza Eghbali & Maryam Fazel - 383-400 Modeling max–min fair bandwidth allocation in BitTorrent communities
by Elvira Antal & Tamás Vinkó
January 2017, Volume 66, Issue 1
- 1-37 On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
by Ricardo M. Lima & Ignacio E. Grossmann - 39-73 On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
by Xingju Cai & Deren Han & Xiaoming Yuan - 75-96 Modified hybrid projection methods for finding common solutions to variational inequality problems
by Dang Hieu & Pham Ky Anh & Le Dung Muu - 97-122 Conic approximation to quadratic optimization with linear complementarity constraints
by Jing Zhou & Shu-Cherng Fang & Wenxun Xing - 123-162 A preconditioned descent algorithm for variational inequalities of the second kind involving the p-Laplacian operator
by Sergio González-Andrade - 163-185 Simple decentralized graph coloring
by Severino F. Galán - 187-218 Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
by Chao Ding & Hou-Duo Qi - 219-222 Erratum to: A regularized Newton method without line search for unconstrained optimization
by Kenji Ueda & Nobuo Yamashita
December 2016, Volume 65, Issue 3
- 545-566 On handling indicator constraints in mixed integer programming
by Pietro Belotti & Pierre Bonami & Matteo Fischetti & Andrea Lodi & Michele Monaci & Amaya Nogales-Gómez & Domenico Salvagnin - 567-603 Are Quasi-Monte Carlo algorithms efficient for two-stage stochastic programs?
by H. Heitsch & H. Leövey & W. Römisch - 605-635 Performance of first- and second-order methods for $$\ell _1$$ ℓ 1 -regularized least squares problems
by Kimon Fountoulakis & Jacek Gondzio - 637-669 Inexact stabilized Benders’ decomposition approaches with application to chance-constrained problems with finite support
by W. Ackooij & A. Frangioni & W. Oliveira - 671-698 Smoothing projected Barzilai–Borwein method for constrained non-Lipschitz optimization
by Yakui Huang & Hongwei Liu - 699-721 Sequential equality-constrained optimization for nonlinear programming
by E. G. Birgin & L. F. Bueno & J. M. Martínez - 723-751 Algebraic rules for computing the regularization parameter of the Levenberg–Marquardt method
by Elizabeth W. Karas & Sandra A. Santos & Benar F. Svaiter - 753-779 A modified Levenberg–Marquardt method with line search for nonlinear equations
by Liang Chen - 781-797 An adaptive gradient method for computing generalized tensor eigenpairs
by Gaohang Yu & Zefeng Yu & Yi Xu & Yisheng Song & Yi Zhou - 799-820 Spherical optimization with complex variablesfor computing US-eigenpairs
by Guyan Ni & Minru Bai - 821-844 An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
by Rafael A. Melo & Phillippe Samer & Sebastián Urrutia - 845-869 Building an iterative heuristic solver for a quantum annealer
by Gili Rosenberg & Mohammad Vazifeh & Brad Woods & Eldad Haber
November 2016, Volume 65, Issue 2
- 309-311 Guest editorial
by Gianni Di Pillo & Massimo Roma - 313-338 Central axes and peripheral points in high dimensional directional datasets
by Annabella Astorino & Manlio Gaudioso & Alberto Seeger - 339-360 On the update of constraint preconditioners for regularized KKT systems
by Stefania Bellavia & Valentina De Simone & Daniela di Serafino & Benedetta Morini - 361-397 A DIRECT-type approach for derivative-free constrained global optimization
by G. Di Pillo & G. Liuzzi & S. Lucidi & V. Piccialli & F. Rinaldi - 399-429 A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
by Giovanni Fasano & Massimo Roma - 431-448 Improved error bound and a hybrid method for generalized Nash equilibrium problems
by Axel Dreves - 449-475 Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
by G. Liuzzi & S. Lucidi & V. Piccialli - 477-491 Solving uniform coverage problem with a modified Remez-algorithm
by D. Nowak & K. H. Küfer - 493-509 Reduction of affine variational inequalities
by Stephen M. Robinson - 511-539 Perfectly competitive capacity expansion games with risk-averse participants
by Dane A. Schiro & Benjamin F. Hobbs & Jong-Shi Pang
September 2016, Volume 65, Issue 1
- 1-46 A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings
by Fu Lin & Sven Leyffer & Todd Munson - 47-71 A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space
by Marcia Fampa & Jon Lee & Wendel Melo - 73-92 Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems
by Markus Leitner - 93-108 On the global convergence of the inexact semi-smooth Newton method for absolute value equation
by J. Y. Bello Cruz & O. P. Ferreira & L. F. Prudente - 127-172 New results on subgradient methods for strongly convex optimization problems with a unified analysis
by Masaru Ito - 173-203 Nonconvex bundle method with application to a delamination problem
by Minh N. Dao & Joachim Gwinner & Dominikus Noll & Nina Ovcharova - 261-288 Global minima for semilinear optimal control problems
by Ahmad Ahmad Ali & Klaus Deckelnick & Michael Hinze - 289-308 A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
by Jiawei Chen & Qamrul Hasan Ansari & Yeong-Cheng Liou & Jen-Chih Yao
July 2016, Volume 64, Issue 3
- 619-645 Stochastic derivative-free optimization using a trust region framework
by Jeffrey Larson & Stephen C. Billups - 647-670 Computing the distance between the linear matrix pencil and the completely positive cone
by Jinyan Fan & Anwa Zhou - 671-697 A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
by Jueyou Li & Guo Chen & Zhaoyang Dong & Zhiyou Wu - 699-724 The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization
by Ole Løseth Elvetun & Bjørn Fredrik Nielsen - 725-754 Alternating direction method of multipliers for penalized zero-variance discriminant analysis
by Brendan P. W. Ames & Mingyi Hong - 755-792 Nonlinear residual minimization by iteratively reweighted least squares
by Juliane Sigl - 793-819 State-defect constraint pairing graph coarsening method for Karush–Kuhn–Tucker matrices arising in orthogonal collocation methods for optimal control
by Begüm Şenses Cannataro & Anil V. Rao & Timothy A. Davis - 821-842 Selective bi-coordinate variations for resource allocation type problems
by I. V. Konnov - 843-864 Column generation approaches for the software clustering problem
by Hugo Harry Kramer & Eduardo Uchoa & Marcia Fampa & Viviane Köhler & François Vanderbeck - 865-880 Feature subset selection for logistic regression via mixed integer optimization
by Toshiki Sato & Yuichi Takano & Ryuhei Miyashiro & Akiko Yoshise - 881-919 Local convex hulls for a special class of integer multicommodity flow problems
by Zhiyuan Lin & Raymond S. K. Kwan
June 2016, Volume 64, Issue 2
- 327-354 An inertia-free filter line-search algorithm for large-scale nonlinear programming
by Nai-Yuan Chiang & Victor M. Zavala - 355-378 Bounding duality gap for separable problems with linear constraints
by Madeleine Udell & Stephen Boyd - 379-406 Clustering-based preconditioning for stochastic programs
by Yankai Cao & Carl D. Laird & Victor M. Zavala - 407-431 Variance reduction in Monte Carlo sampling-based optimality gap estimators for two-stage stochastic linear programming
by Rebecca Stockbridge & Güzin Bayraksan - 433-465 Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
by Li-Ping Pang & Jian Lv & Jin-He Wang - 467-488 Sufficient weighted complementarity problems
by Florian A. Potra - 489-511 On how to solve large-scale log-determinant optimization problems
by Chengjing Wang - 513-533 Theoretical and computational results about optimality-based domain reductions
by Alberto Caprara & Marco Locatelli & Michele Monaci - 535-555 A generalization of $$\omega $$ ω -subdivision ensuring convergence of the simplicial algorithm
by Takahito Kuno & Tomohiro Ishihama - 557-588 Distortion compensation as a shape optimisation problem for a sharp interface model
by Kevin Sturm & Michael Hintermüller & Dietmar Hömberg - 589-618 Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results
by Günter Rudolph & Oliver Schütze & Christian Grimme & Christian Domínguez-Medina & Heike Trautmann
May 2016, Volume 64, Issue 1
- 1-30 On an adaptive regularization for ill-posed nonlinear systems and its trust-region implementation
by S. Bellavia & B. Morini & E. Riccietti - 31-73 An adaptive accelerated first-order method for convex optimization
by Renato D. C. Monteiro & Camilo Ortiz & Benar F. Svaiter - 75-100 A bundle method using two polyhedral approximations of the $$\varepsilon $$ ε -enlargement of a maximal monotone operator
by Ludovic Nagesseur - 101-118 A Dai–Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
by Hiroyuki Sato - 119-148 Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems
by Le Han & Shujun Bi & Shaohua Pan - 149-176 Higher-degree eigenvalue complementarity problems for tensors
by Chen Ling & Hongjin He & Liqun Qi - 177-214 Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
by Alexander Veremyev & Oleg A. Prokopyev & Sergiy Butenko & Eduardo L. Pasiliao - 215-242 Exact solution approaches for bilevel assignment problems
by Behdad Beheshti & Oleg A. Prokopyev & Eduardo L. Pasiliao - 243-263 A new local dimming algorithm based on the simplex method
by Martin Riplinger & Michael Krause & Alfred K. Louis & Chihao Xu - 265-294 Optimization of nonlocal time-delayed feedback controllers
by Peter Nestler & Eckehard Schöll & Fredi Tröltzsch - 295-326 Discretization of semilinear bang-singular-bang control problems
by Ursula Felgenhauer
April 2016, Volume 63, Issue 3
- 613-638 On an inexact trust-region SQP-filter method for constrained nonlinear optimization
by Andrea Walther & Lorenz Biegler - 613-638 On an inexact trust-region SQP-filter method for constrained nonlinear optimization
by Andrea Walther & Lorenz Biegler - 639-684 Active-set prediction for interior point methods using controlled perturbations
by Coralia Cartis & Yiming Yan - 639-684 Active-set prediction for interior point methods using controlled perturbations
by Coralia Cartis & Yiming Yan - 685-703 On the solution of convex bilevel optimization problems
by S. Dempe & S. Franke - 705-735 Approximated perspective relaxations: a project and lift approach
by Antonio Frangioni & Fabio Furini & Claudio Gentile - 737-753 Towards an objective feasibility pump for convex MINLPs
by Shaurya Sharma & Brage Knudsen & Bjarne Grimstad - 755-792 Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem
by Luis Bicalho & Alexandre Cunha & Abilio Lucena - 793-824 Finite element error estimates for an optimal control problem governed by the Burgers equation
by Pedro Merino - 825-853 Dirichlet control of elliptic state constrained problems
by Mariano Mateos & Ira Neitzel - 855-873 Numerical enclosures of the optimal cost of the Kantorovitch’s mass transportation problem
by Nicolas Delanoue & Mehdi Lhommeau & Philippe Lucidarme - 855-873 Numerical enclosures of the optimal cost of the Kantorovitch’s mass transportation problem
by Nicolas Delanoue & Mehdi Lhommeau & Philippe Lucidarme - 875-902 On multiobjective selection for multimodal optimization
by Simon Wessing & Mike Preuss - 903-926 Analysis of multi-objective Kriging-based methods for constrained global optimization
by Cédric Durantin & Julien Marzat & Mathieu Balesdent
March 2016, Volume 63, Issue 2
- 305-332 The directed search method for multi-objective memetic algorithms
by Oliver Schütze & Adanay Martín & Adriana Lara & Sergio Alvarado & Eduardo Salinas & Carlos Coello - 333-364 Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
by Ting Pong & Hao Sun & Ningchuan Wang & Henry Wolkowicz - 365-392 Bounded perturbation resilience of projected scaled gradient methods
by Wenma Jin & Yair Censor & Ming Jiang - 393-423 An efficient method for solving a matrix least squares problem over a matrix inequality constraint
by Jiao-fen Li & Wen Li & Ru Huang - 425-459 Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions
by Andreas Fischer & Markus Herrich & Alexey Izmailov & Mikhail Solodov - 461-493 Copositivity tests based on the linear complementarity problem
by Carmo Brás & Gabriele Eichfelder & Joaquim Júdice - 495-522 Constructions of complementarity functions and merit functions for circular cone complementarity problem
by Xin-He Miao & Shengjuan Guo & Nuo Qi & Jein-Shan Chen - 523-542 On the steepest descent algorithm for quadratic functions
by Clóvis Gonzaga & Ruana Schneider - 543-557 Reliable updates of the transformation in the iterative closest point algorithm
by Per Bergström - 559-583 On the shortest path problem with negative cost cycles
by Luigi Di Puglia Pugliese & Francesca Guerriero - 585-612 A fast implementation for the 2D/3D box placement problem
by Wenbin Zhu & Zhixing Luo & Andrew Lim & Wee-Chong Oon
January 2016, Volume 63, Issue 1
- 1-28 A proximal bundle method for nonsmooth nonconvex functions with inexact information
by W. Hare & C. Sagastizábal & M. Solodov - 29-44 An acceleration scheme for Dykstra’s algorithm
by Williams López & Marcos Raydan - 45-67 Using multiobjective optimization to map the entropy region
by László Csirmaz - 69-95 A leapfrog semi-smooth Newton-multigrid method for semilinear parabolic optimal control problems
by Jun Liu & Mingqing Xiao - 97-120 Lagrangian heuristics for the Quadratic Knapsack Problem
by Jesus Cunha & Luidi Simonetti & Abilio Lucena - 121-142 Exact line and plane search for tensor optimization
by Laurent Sorber & Ignat Domanov & Marc Barel & Lieven Lathauwer - 143-168 On the cone eigenvalue complementarity problem for higher-order tensors
by Chen Ling & Hongjin He & Liqun Qi - 169-202 An iterative algorithm for third-order tensor multi-rank minimization
by Lei Yang & Zheng-Hai Huang & Shenglong Hu & Jiye Han - 203-236 Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach
by Yoshihiro Kanno - 237-271 Optimization of current carrying multicables
by Helmut Harbrecht & Florian Loos - 273-303 A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
by Liusheng Hou & Hongjin He & Junfeng Yang
December 2015, Volume 62, Issue 3
- 613-639 Optimizing over coherent risk measures and non-convexities: a robust mixed integer optimization approach
by Dimitris Bertsimas & Akiko Takeda - 641-668 Dynamic generation of scenario trees
by Georg Pflug & Alois Pichler - 669-692 Scenario generation for stochastic optimization problems via the sparse grid method
by Michael Chen & Sanjay Mehrotra & Dávid Papp - 693-715 Mesh adaptive direct search with second directional derivative-based Hessian update
by Árpád Bűrmen & Jernej Olenšek & Tadej Tuma - 717-759 Convex reformulations for solving a nonlinear network design problem
by Jesco Humpola & Armin Fügenschuh - 761-786 AAR-based decomposition algorithm for non-linear convex optimisation
by Nima Rabiei & Jose Muñoz - 787-814 A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems
by J. Terán-Villanueva & Héctor Fraire Huacuja & Juan Carpio Valadez & Rodolfo Pazos Rangel & Héctor Puga Soberanes & José Martínez Flores - 815-850 The augmented Lagrangian method based on the APG strategy for an inverse damped gyroscopic eigenvalue problem
by Yue Lu & Liwei Zhang - 851-890 Feasibility preserving constraint-handling strategies for real parameter evolutionary optimization
by Nikhil Padhye & Pulkit Mittal & Kalyanmoy Deb
November 2015, Volume 62, Issue 2
- 323-346 Globally convergent evolution strategies for constrained optimization
by Y. Diouane & S. Gratton & L. Vicente - 347-372 A fast splitting method tailored for Dantzig selector
by Hongjin He & Xingju Cai & Deren Han - 373-404 Inexact accelerated augmented Lagrangian methods
by Myeongmin Kang & Myungjoo Kang & Miyoun Jung - 405-429 Combining stabilized SQP with the augmented Lagrangian algorithm
by A. Izmailov & M. Solodov & E. Uskov - 431-475 A robust and informative method for solving large-scale power flow problems
by Walter Murray & Tomás Tinoco De Rubira & Adam Wigington - 477-515 Finite purchasing power and computations of Bertrand–Nash equilibrium prices
by W. Morrow - 517-544 On a topology optimization problem governed by two-dimensional Helmholtz equation
by Jaroslav Haslinger & Raino Mäkinen - 545-564 A review of distances for the Mallows and Generalized Mallows estimation of distribution algorithms
by Josu Ceberio & Ekhine Irurozki & Alexander Mendiburu & Jose Lozano - 565-588 An improved test set approach to nonlinear integer problems with applications to engineering design
by J. Gago-Vargas & I. Hartillo & J. Puerto & J. Ucha - 589-607 Tabu search and GRASP for the capacitated clustering problem
by Anna Martínez-Gavara & Vicente Campos & Micael Gallego & Manuel Laguna & Rafael Martí
September 2015, Volume 62, Issue 1
- 1-3 Introduction to the special issue for EUCCO 2013
by Peter Benner & Roland Herzog & Michael Hinze & Arnd Rösch & Anton Schiela & Volker Schulz - 5-29 Low-rank retractions: a survey and new results
by P.-A. Absil & I. Oseledets - 31-65 Boundary concentrated finite elements for optimal control problems with distributed observation
by S. Beuchler & K. Hofer & D. Wachsmuth & J.-E. Wurst - 67-83 Numerical methods for parameter identification in stationary radiative transfer
by Herbert Egger & Matthias Schlottbom - 85-109 The semismooth Newton method for the solution of quasi-variational inequalities
by Francisco Facchinei & Christian Kanzow & Sebastian Karl & Simone Sagratella - 111-129 Optimizing fiber orientation in fiber-reinforced materials using efficient upscaling
by S. Frei & H. Andrä & R. Pinnau & O. Tse - 131-155 Lossy compression for PDE-constrained optimization: adaptive error control
by Sebastian Götschel & Martin Weiser - 157-180 Annular and sectorial sparsity in optimal control of elliptic equations
by Roland Herzog & Johannes Obermeier & Gerd Wachsmuth - 181-216 Moreau–Yosida regularization in shape optimization with geometric constraints
by Moritz Keuthen & Michael Ulbrich - 217-239 Parameter identification for nonlinear elliptic-parabolic systems with application in lithium-ion battery modeling
by Oliver Lass & Stefan Volkwein - 241-270 Optimal control of electrorheological fluids through the action of electric fields
by Juan De Los Reyes & Irwin Yousept - 271-289 Robust error estimates for regularization and discretization of bang–bang control problems
by Daniel Wachsmuth - 291-321 Adaptive discontinuous Galerkin methods for state constrained optimal control problems governed by convection diffusion equations
by Hamdullah Yücel & Peter Benner
July 2015, Volume 61, Issue 3
- 557-570 Sparsity preserving preconditioners for linear systems in interior-point methods
by Milan Dražić & Rade Lazović & Vera Kovačević-Vujčić - 571-607 Using an outward selective pressure for improving the search quality of the MOEA/D algorithm
by Krzysztof Michalak - 609-634 Path following in the exact penalty method of convex programming
by Hua Zhou & Kenneth Lange - 635-668 An alternating direction method with increasing penalty for stable principal component pursuit
by N. Aybat & G. Iyengar - 669-688 Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
by Felix Lieder & Fatemeh Rad & Florian Jarre - 689-711 Potential induced random teleportation on finite graphs
by Shui-Nee Chow & Xiaojing Ye & Haomin Zhou - 713-729 A filling function method for unconstrained global optimization
by F. Lampariello & G. Liuzzi - 731-760 Convergence results for the discrete regularization of linear-quadratic control problems with bang–bang solutions
by Martin Seydenschwanz - 761-781 A collision detection approach for maximizing the material utilization
by Volker Maag - 783-818 A finite hyperplane traversal Algorithm for 1-dimensional $$L^1pTV$$ L 1 p T V minimization, for $$0>p\le 1$$ 0 > p ≤ 1
by Heather Moon & Thomas Asaki
June 2015, Volume 61, Issue 2
- 275-319 Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
by Niao He & Anatoli Juditsky & Arkadi Nemirovski - 321-341 A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems
by M. Reza Peyghami & D. Ataee Tarzanagh - 343-372 An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
by Ghassan Shobaki & Jafar Jamal - 373-408 Superconvergence for Neumann boundary control problems governed by semilinear elliptic equations
by K. Krumbiegel & J. Pfefferer - 409-435 A primal-dual interior point method for large-scale free material optimization
by Alemseged Weldeyesus & Mathias Stolpe - 437-461 The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
by Radek Kučera & Kristina Motyčková & Alexandros Markopoulos - 463-487 Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
by Prasanna Balaprakash & Mauro Birattari & Thomas Stützle & Marco Dorigo - 489-515 Terminating evolutionary algorithms at their steady state
by Debora Gil & David Roche & Agnés Borràs & Jesús Giraldo