Printed from https://ideas.repec.org/s/spr/coopap6.html
Content
October 2014, Volume 59, Issue 1
- 219-248 Approximation methods for complex polynomial optimization
by Bo Jiang & Zhening Li & Shuzhong Zhang - 249-262 Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints
by Christian Kanzow & Alexandra Schwartz - 263-284 A constrained optimization reformulation and a feasible descent direction method for $$L_{1/2}$$ L 1 / 2 regularization
by Dong-Hui Li & Lei Wu & Zhe Sun & Xiong-ji Zhang - 285-306 Optimal parameter selection for nonlinear multistage systems with time-delays
by Chongyang Liu & Ryan Loxton & Kok Teo - 307-319 Space tensor conic programming
by Liqun Qi & Yinyu Ye - 321-351 A regularized Newton method without line search for unconstrained optimization
by Kenji Ueda & Nobuo Yamashita - 353-377 A smoothing augmented Lagrangian method for solving simple bilevel programs
by Mengwei Xu & Jane Ye - 379-397 Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
by Xiaojin Zheng & Xiaoling Sun & Duan Li & Jie Sun
July 2014, Volume 58, Issue 3
- 523-541 Adaptively refined dynamic program for linear spline regression
by Noam Goldberg & Youngdae Kim & Sven Leyffer & Thomas Veselka - 543-561 Robust registration of point sets using iteratively reweighted least squares
by Per Bergström & Ove Edlund - 563-595 Revisiting several problems and algorithms in continuous location with $$\ell _\tau $$ ℓ τ norms
by Victor Blanco & Justo Puerto & Safae El Haj Ben Ali - 597-618 On the semilocal convergence behavior for Halley’s method
by Yonghui Ling & Xiubin Xu - 619-644 POD a-posteriori error analysis for optimal control problems with mixed control-state constraints
by Martin Gubisch & Stefan Volkwein - 645-677 Adaptive POD basis computation for parametrized nonlinear systems using optimal snapshot location
by Oliver Lass & Stefan Volkwein - 679-705 Subgrid scale eddy viscosity finite element method on optimal control of system governed by unsteady Oseen equations
by Gang Chen & Minfu Feng - 707-756 A survey on multi-objective evolutionary algorithms for many-objective problems
by Christian Lücken & Benjamín Barán & Carlos Brizuela - 757-779 Implementation aspects of interactive multiobjective optimization for modeling environments: the case of GAMS-NIMBUS
by Vesa Ojalehto & Kaisa Miettinen & Timo Laukkanen - 781-806 Advanced particle swarm assisted genetic algorithm for constrained optimization problems
by Manoj Dhadwal & Sung Jung & Chang Kim
June 2014, Volume 58, Issue 2
- 273-322 The generalized trust region subproblem
by Ting Pong & Henry Wolkowicz - 323-346 Interior-point methods for nonconvex nonlinear programming: cubic regularization
by Hande Benson & David Shanno - 347-379 Robust least square semidefinite programming with applications
by Guoyin Li & Alfred Ma & Ting Pong - 381-407 Proximal methods for the latent group lasso penalty
by Silvia Villa & Lorenzo Rosasco & Sofia Mosci & Alessandro Verri - 409-421 A unified algorithm for mixed $$l_{2,p}$$ l 2 , p -minimizations and its application in feature selection
by Liping Wang & Songcan Chen & Yuanping Wang - 423-454 The space decomposition theory for a class of eigenvalue optimizations
by Ming Huang & Li-Ping Pang & Zun-Quan Xia - 455-482 A sparsity preserving stochastic gradient methods for sparse regression
by Qihang Lin & Xi Chen & Javier Peña - 483-501 CVaR-constrained stochastic programming reformulation for stochastic nonlinear complementarity problems
by Liyan Xu & Bo Yu - 503-522 Determination of initial temperature in fast simulated annealing
by Chang-Yong Lee & Dongju Lee
May 2014, Volume 58, Issue 1
- 1-29 Efficient algorithms for robust and stable principal component pursuit problems
by Necdet Aybat & Donald Goldfarb & Shiqian Ma - 31-85 Approximate dynamic programming for stochastic N-stage optimization with application to optimal consumption under uncertainty
by Mauro Gaggero & Giorgio Gnecco & Marcello Sanguineti - 87-103 On R-linear convergence of semi-monotonic inexact augmented Lagrangians for saddle point problems
by Zdeněk Dostál & David Horák & Petr Vodstrčil - 105-132 Properties and methods for finding the best rank-one approximation to higher-order tensors
by Yuning Yang & Qingzhi Yang & Liqun Qi - 133-159 Semidefinite relaxations for semi-infinite polynomial programming
by Li Wang & Feng Guo - 161-185 Strategic oscillation for the quadratic multiple knapsack problem
by Carlos García-Martínez & Fred Glover & Francisco Rodriguez & Manuel Lozano & Rafael Martí - 187-203 A tabu search approach for proportionate multiprocessor open shop scheduling
by Tamer Abdelmaguid & Mohamed Shalaby & Mohamed Awwad - 205-224 Graph partitions for the multidimensional assignment problem
by Chrysafis Vogiatzis & Eduardo Pasiliao & Panos Pardalos - 225-247 Local convergence of quasi-Newton methods under metric regularity
by F. Aragón Artacho & A. Belyakov & A. Dontchev & M. López - 249-272 Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions
by Bryan Gardiner & Khan Jakee & Yves Lucet
April 2014, Volume 57, Issue 3
- 517-553 A class of distributed optimization methods with event-triggered communication
by Martin Meinel & Michael Ulbrich & Sebastian Albrecht - 555-597 Level bundle methods for constrained convex optimization with various oracles
by Wim Ackooij & Welington Oliveira - 599-621 A derivative-free algorithm for linearly constrained optimization problems
by E. Gumma & M. Hashim & M. Ali - 623-665 Curvature integrals and iteration complexities in SDP and symmetric cone programs
by Satoshi Kakihara & Atsumi Ohara & Takashi Tsuchiya - 667-684 On regularity conditions for complementarity problems
by A. Izmailov & A. Kurennoy - 685-702 A numerical method for nonconvex multi-objective optimal control problems
by C. Kaya & Helmut Maurer - 703-729 A priori error analysis of the upwind symmetric interior penalty Galerkin (SIPG) method for the optimal control problems governed by unsteady convection diffusion equations
by Tuğba Akman & Hamdullah Yücel & Bülent Karasözen - 731-760 Adaptive sequencing of primal, dual, and design steps in simulation based optimization
by Torsten Bosse & Lutz Lehmann & Andreas Griewank - 761-794 Enhancing performance of particle swarm optimization through an algorithmic link with genetic algorithms
by Kalyanmoy Deb & Nikhil Padhye
March 2014, Volume 57, Issue 2
- 271-306 An infeasible-point subgradient method using adaptive approximate projections
by Dirk Lorenz & Marc Pfetsch & Andreas Tillmann - 307-337 A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
by Ion Necoara & Andrei Patrascu - 339-363 On the O(1/t) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
by Xingju Cai & Guoyong Gu & Bingsheng He - 365-386 An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
by Dan Xue & Wenyu Sun & Liqun Qi - 387-402 Lower bounds on the global minimum of a polynomial
by M. Ghasemi & J. Lasserre & M. Marshall - 403-415 On the computational complexity of membership problems for the completely positive cone and its dual
by Peter Dickinson & Luuk Gijben - 417-440 Global convergence of modified multiplicative updates for nonnegative matrix factorization
by Norikazu Takahashi & Ryota Hibi - 441-468 Optimizing a multi-stage production/inventory system by DC programming based approaches
by Hoai Le Thi & Duc Tran - 469-492 Parallel deterministic and stochastic global minimization of functions with very many minima
by David Easterling & Layne Watson & Michael Madigan & Brent Castle & Michael Trosset - 493-516 A particle swarm inspired multi-elitist artificial bee colony algorithm for real-parameter optimization
by Yi Xiang & Yuming Peng & Yubin Zhong & Zhenyu Chen & Xuwen Lu & Xuejun Zhong
January 2014, Volume 57, Issue 1
- 1-25 A superlinearly convergent R-regularized Newton scheme for variational models with concave sparsity-promoting priors
by Michael Hintermüller & Tao Wu - 27-43 A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization
by Hongchao Zhang - 45-69 Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
by Renato Monteiro & Camilo Ortiz & Benar Svaiter - 71-104 A cutting-plane algorithm for solving a weighted influence interdiction problem
by Mehdi Hemmati & J. Cole Smith & My Thai - 105-127 Mixed-logit network pricing
by François Gilbert & Patrice Marcotte & Gilles Savard - 129-165 A generative model and a generalized trust region Newton method for noise reduction
by Seppo Pulkkinen & Marko Mäkelä & Napsu Karmitsa - 167-203 SDDP for some interstage dependent risk-averse problems and application to hydro-thermal planning
by Vincent Guigues - 205-240 Third order convergent time discretization for parabolic optimal control problems with control constraints
by Andreas Springer & Boris Vexler - 241-270 A minimum effort optimal control problem for the wave equation
by Axel Kröner & Karl Kunisch
December 2013, Volume 56, Issue 3
- 507-530 An efficient augmented Lagrangian method with applications to total variation minimization
by Chengbo Li & Wotao Yin & Hong Jiang & Yin Zhang - 531-558 Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
by Huixian Wu & Hezhi Luo & Xiaodong Ding & Guanting Chen - 559-572 A customized proximal point algorithm for convex minimization with linear constraints
by Bingsheng He & Xiaoming Yuan & Wenxing Zhang - 573-597 A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
by María Gonzalez-Lima & Aurelio Oliveira & Danilo Oliveira - 599-617 New smoothing SVM algorithm with tight error bound and efficient reduced techniques
by Shuisheng Zhou & Jiangtao Cui & Feng Ye & Hongwei Liu & Qiang Zhu - 619-633 A two-phase heuristic for the bottleneck k-hyperplane clustering problem
by Edoardo Amaldi & Kanika Dhyani & Leo Liberti - 635-674 Particle methods for stochastic optimal control problems
by Pierre Carpentier & Guy Cohen & Anes Dallagi - 675-721 Three new stochastic local search algorithms for continuous optimization problems
by Sivashan Chetty & Aderemi Adewumi - 723-734 Solving the median problem with continuous demand on a network
by Rafael Blanquero & Emilio Carrizosa - 735-764 Landscape analysis and efficient metaheuristics for solving the n-queens problem
by Ellips Masehian & Hossein Akbaripour & Nasrin Mohabbati-Kalejahi
October 2013, Volume 56, Issue 2
- 253-290 Preconditioning Newton–Krylov methods in nonconvex large scale optimization
by Giovanni Fasano & Massimo Roma - 291-315 CARTopt: a random search method for nonsmooth unconstrained optimization
by B. Robertson & C. Price & M. Reale - 317-341 Symmetric Perry conjugate gradient method
by Dongyi Liu & Genqi Xu - 343-368 Implementing the simplex method as a cutting-plane method, with a view to regularization
by Csaba Fábián & Olga Papp & Krisztián Eretnek - 369-403 A semismooth Newton method for a class of semilinear optimal control problems with box and volume constraints
by Samuel Amstutz & Antoine Laurain - 405-438 Lower and upper bounds for the spanning tree with minimum branch vertices
by Francesco Carrabs & Raffaele Cerulli & Manlio Gaudioso & Monica Gentili - 439-455 Frequency assignment in a SDMA satellite communication system with beam decentring feature
by Kata Kiatmanaroj & Christian Artigues & Laurent Houssin & Frédéric Messine - 457-480 Studying the effect of using low-discrepancy sequences to initialize population-based optimization algorithms
by Mahamed Omran & Salah al-Sharhan & Ayed Salman & Maurice Clerc - 481-502 The continuous differential ant-stigmergy algorithm for numerical optimization
by Peter Korošec & Jurij Šilc
September 2013, Volume 56, Issue 1
- 1-38 A derivative-free approximate gradient sampling algorithm for finite minimax problems
by W. Hare & J. Nutini - 39-61 Using inexact gradients in a multilevel optimization algorithm
by Robert Lewis & Stephen Nash - 63-80 A Shamanskii-like Levenberg-Marquardt method for nonlinear equations
by Jinyan Fan - 81-96 A homotopy method for nonlinear semidefinite programming
by Li Yang & Bo Yu - 97-111 Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem
by José Figueira & Luís Paquete & Marco Simões & Daniel Vanderpooten - 113-130 Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
by Svyatoslav Trukhanov & Chitra Balasubramaniam & Balabhaskar Balasundaram & Sergiy Butenko - 131-151 Error estimates for parabolic optimal control problems with control and state constraints
by Wei Gong & Michael Hinze - 153-185 On the optimal control of the Schlögl-model
by Rico Buchholz & Harald Engel & Eileen Kammann & Fredi Tröltzsch - 187-188 Erratum to: On the optimal control of the Schlögl-model
by Rico Buchholz & Harald Engel & Eileen Kammann & Fredi Tröltzsch - 189-208 Multi Agent Collaborative Search based on Tchebycheff decomposition
by Federico Zuiani & Massimiliano Vasile - 209-229 Parameter-less algorithm for evolutionary-based optimization
by Gregor Papa - 231-251 A simplex-based numerical framework for simple and efficient robust design optimization
by Pietro Congedo & Jeroen Witteveen & Gianluca Iaccarino
July 2013, Volume 55, Issue 3
- 545-570 An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
by Kuo-Ling Huang & Sanjay Mehrotra - 571-596 Parallel distributed-memory simplex for large-scale stochastic LP problems
by Miles Lubin & J. Hall & Cosmin Petra & Mihai Anitescu - 597-645 Stochastic Nash equilibrium problems: sample average approximation and applications
by Huifu Xu & Dali Zhang - 647-674 A cutting plane algorithm for the Capacitated Connected Facility Location Problem
by Stefan Gollowitzer & Bernard Gendron & Ivana Ljubić - 675-702 Stable local volatility function calibration using spline kernel
by Thomas Coleman & Yuying Li & Cheng Wang - 703-731 A new method for solving Pareto eigenvalue complementarity problems
by Samir Adly & Hadia Rammal - 733-767 A smoothing-regularization approach to mathematical programs with vanishing constraints
by Wolfgang Achtziger & Tim Hoheisel & Christian Kanzow - 769-802 Optimal error estimates for finite element discretization of elliptic optimal control problems with finitely many pointwise state constraints
by Dmitriy Leykekhman & Dominik Meidner & Boris Vexler
June 2013, Volume 55, Issue 2
- 265-309 On sample size control in sample average approximations for solving smooth stochastic programs
by Johannes Royset - 311-340 A decomposition-based crash-start for stochastic programming
by Marco Colombo & Andreas Grothey - 341-377 Regularized robust optimization: the optimal portfolio execution case
by Somayeh Moazeni & Thomas Coleman & Yuying Li - 379-398 Tightening a copositive relaxation for standard quadratic optimization problems
by Yong Xia & Ruey-Lin Sheu & Xiaoling Sun & Duan Li - 399-425 Smoothing SQP algorithm for semismooth equations with box constraints
by Changyu Wang & Qian Liu & Cheng Ma - 427-457 Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures
by A. Cassioli & L. Consolini & M. Locatelli & A. Longo - 459-468 On an inexact gradient method using Proper Orthogonal Decomposition for parabolic optimal control problems
by Christian Jörres & Georg Vossen & Michael Herty - 469-480 Classification of companies using maximal margin ellipsoidal surfaces
by Hiroshi Konno & Masato Saito - 481-513 A novel differential evolution algorithm for binary optimization
by Mina Husseinzadeh Kashan & Ali Husseinzadeh Kashan & Nasim Nahavandi - 515-544 Parallel multiobjective evolutionary algorithms for batch scheduling in heterogeneous computing and grid systems
by Sergio Nesmachnow
May 2013, Volume 55, Issue 1
- 1-20 A computational study and survey of methods for the single-row facility layout problem
by Philipp Hungerländer & Franz Rendl - 21-47 SDP reformulation for robust optimization problems based on nonconvex QP duality
by Ryoichi Nishimura & Shunsuke Hayashi & Masao Fukushima - 49-71 A trust region method for solving semidefinite programs
by Aiqun Huang & Chengxian Xu - 73-73 Erratum to: A trust region method for solving semidefinite programs
by Aiqun Huang & Chengxian Xu - 75-111 Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
by Quoc Tran Dinh & Carlo Savorgnan & Moritz Diehl - 113-135 Mixed-Integer Linear Programming Formulations for the Software Clustering Problem
by Viviane Köhler & Marcia Fampa & Olinto Araújo - 137-153 Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials
by Sabine Burgdorf & Kristijan Cafuta & Igor Klep & Janez Povh - 155-172 A second-order smooth penalty function algorithm for constrained optimization problems
by Xinsheng Xu & Zhiqing Meng & Jianwu Sun & Liguo Huang & Rui Shen - 173-196 Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization
by Hongwei Liu & Xiangli Li - 197-225 Relaxation methods for mixed-integer optimal control of partial differential equations
by Falk Hante & Sebastian Sager - 227-263 Vortex control of instationary channel flows using translation invariant cost functionals
by H. Kasumba & K. Kunisch
April 2013, Volume 54, Issue 3
- 461-472 A subgradient method for multiobjective optimization
by J. Cruz Neto & G. Silva & O. Ferreira & J. Lopes - 473-493 Inexact projected gradient method for vector optimization
by Ellen Fukuda & L. Graña Drummond - 495-516 Newton-like methods for efficient solutions in vector optimization
by Thai Chuong - 517-554 On convex quadratic programs with linear complementarity constraints
by Lijie Bai & John Mitchell & Jong-Shi Pang - 555-578 Improved constraint consensus methods for seeking feasibility in nonlinear programs
by Laurence Smith & John Chinneck & Victor Aitken - 579-593 Variable projection for nonlinear least squares problems
by Dianne O’Leary & Bert Rust - 595-617 An inexact restoration strategy for the globalization of the sSQP method
by D. Fernández & E. Pilotta & G. Torres - 619-643 The robust network loading problem with dynamic routing
by Sara Mattia - 645-673 The resource-constrained modulo scheduling problem: an experimental study
by Maria Ayala & Abir Benabid & Christian Artigues & Claire Hanen - 675-703 A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems
by Hatem Fayed & Amir Atiya - 705-705 Erratum to: A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems
by Hatem Fayed & Amir Atiya - 707-739 A penalty function-based differential evolution algorithm for constrained global optimization
by M. Ali & W. Zhu - 741-770 Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
by Iztok Fister & Marjan Mernik & Bogdan Filipič - 771-790 Self-adaptive differential evolution incorporating a heuristic mixing of operators
by Saber Elsayed & Ruhul Sarker & Daryl Essam
March 2013, Volume 54, Issue 2
- 211-213 Guest editorial
by Mario Bertero & Valeria Ruggiero & Luca Zanni - 215-237 A full second order variational model for multiscale texture analysis
by Maïtine Bergounioux & Loïc Piffet - 239-262 A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
by Radu Boţ & Christopher Hendrich - 263-282 Preconditioned iterative regularization in Banach spaces
by Paola Brianzi & Fabio Di Benedetto & Claudio Estatico - 283-315 Linear convergence analysis of the use of gradient projection methods on total variation problems
by Pengwen Chen & Changfeng Gui - 317-342 Bregman operator splitting with variable stepsize for total variation image reconstruction
by Yunmei Chen & William Hager & Maryam Yashtini & Xiaojing Ye & Hongchao Zhang - 343-369 An ADM-based splitting method for separable convex programming
by Deren Han & Xiaoming Yuan & Wenxing Zhang & Xingju Cai - 371-398 A class of quasi-variational inequalities for adaptive image denoising and decomposition
by Frank Lenzen & Florian Becker & Jan Lellmann & Stefania Petra & Christoph Schnörr - 399-416 An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography
by Ignace Loris & Caroline Verhoeven - 417-440 A cyclic projected gradient method
by Simon Setzer & Gabriele Steidl & Jan Morgenthaler - 441-459 Primal and dual alternating direction algorithms for ℓ 1 -ℓ 1 -norm minimization problems in compressive sensing
by Yunhai Xiao & Hong Zhu & Soon-Yi Wu
January 2013, Volume 54, Issue 1
- 1-25 Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems
by Serge Gratton & Selime Gürol & Philippe Toint - 27-43 Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems
by María Maciel & María Mendonça & Adriana Verdiell - 45-64 Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
by Gonglin Yuan & Zengxin Wei & Zhongxing Wang - 65-76 Convergence and perturbation resilience of dynamic string-averaging projection methods
by Yair Censor & Alexander Zaslavski - 77-91 An acceleration scheme for cyclic subgradient projections method
by Touraj Nikazad & Mokhtar Abbasi - 93-109 A practical but rigorous approach to sum-of-ratios optimization in geometric applications
by Takahito Kuno & Toshiyuki Masaki - 111-139 On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere
by Lei-Hong Zhang - 141-162 An efficient compact quadratic convex reformulation for general integer quadratic programs
by Alain Billionnet & Sourour Elloumi & Amélie Lambert - 163-187 A new Branch and Bound method for a discrete truss topology design problem
by Adelaide Cerveira & Agostinho Agra & Fernando Bastos & Joaquim Gromicho - 189-210 A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
by M. Diehl & B. Houska & O. Stein & P. Steuermann
December 2012, Volume 53, Issue 3
- 649-680 Branch and cut algorithms for detecting critical nodes in undirected graphs
by Marco Di Summa & Andrea Grosso & Marco Locatelli - 681-709 A local relaxation method for the cardinality constrained portfolio optimization problem
by Walter Murray & Howard Shek - 711-728 Computing the variance of tour costs over the solution space of the TSP in polynomial time
by Paul Sutcliffe & Andrew Solomon & Jenny Edwards - 729-753 A computational analysis of lower bounds for big bucket production planning problems
by Kerem Akartunalı & Andrew Miller - 755-769 Descentwise inexact proximal algorithms for smooth optimization
by Marc Fuentes & Jérôme Malick & Claude Lemaréchal - 771-794 Constrained Dogleg methods for nonlinear systems with simple bounds
by Stefania Bellavia & Maria Macconi & Sandra Pieraccini - 795-806 A new modified nonmonotone adaptive trust region method for unconstrained optimization
by Zhaocheng Cui & Boying Wu - 807-821 Generalized weak sharp minima in cone-constrained convex optimization with applications
by H. Luo & X. Huang & J. Peng - 823-844 Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
by Hayato Waki & Maho Nakata & Masakazu Muramatsu - 845-867 On solving biquadratic optimization via semidefinite relaxation
by Yuning Yang & Qingzhi Yang - 869-902 A genetic algorithm based augmented Lagrangian method for constrained optimization
by Kalyanmoy Deb & Soumil Srivastava - 903-931 Computational optimization strategies for the simulation of random media and components
by Edoardo Patelli & Gerhart Schuëller
October 2012, Volume 53, Issue 2
- 297-299 Guest editorial
by Gianni Pillo & Massimo Roma - 301-322 Margin maximization in spherical separation
by Annabella Astorino & Antonio Fuduli & Manlio Gaudioso - 323-346 Gap functions and penalization for solving equilibrium problems with nonlinear constraints
by Giancarlo Bigi & Mauro Passacantando - 347-373 Evaluating bound-constrained minimization software
by Ernesto Birgin & Jan Gentil - 375-393 Convergence of distributed optimal control problems governed by elliptic variational inequalities
by Mahdi Boukrouche & Domingo Tarzia - 395-423 An active set feasible method for large-scale minimization problems with bound constraints
by M. Santis & G. Pillo & S. Lucidi - 425-452 Active-set Newton methods for mathematical programs with vanishing constraints
by A. Izmailov & A. Pogosyan - 453-483 Interior point methods for equilibrium problems
by Nils Langenberg - 485-503 Approximate values for mathematical programs with variational inequality constraints
by M. Lignola & Jacqueline Morgan - 505-526 Derivative-free methods for bound constrained mixed-integer optimization
by G. Liuzzi & S. Lucidi & F. Rinaldi - 527-555 On the convergence of trust region algorithms for unconstrained minimization without derivatives
by M. Powell - 557-589 Convergence analysis of a proximal Gauss-Newton method
by Saverio Salzo & Silvia Villa - 591-617 Reduced order solution of structured linear systems arising in certain PDE-constrained optimization problems
by V. Simoncini - 619-648 Strong duality and minimal representations for cone optimization
by Levent Tunçel & Henry Wolkowicz
September 2012, Volume 53, Issue 1
- 1-22 Updating the regularization parameter in the adaptive cubic regularization algorithm
by N. Gould & M. Porcelli & P. Toint - 23-44 Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
by Ting Pong - 45-89 An inexact spectral bundle method for convex quadratic semidefinite programming
by Huiling Lin - 91-113 Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
by Ting-Jang Shiu & Soon-Yi Wu - 115-130 The nearest point problem in a polyhedral set and its extensions
by Zhe Liu & Yahya Fathi - 131-153 An intermodal multicommodity routing problem with scheduled services
by Burak Ayar & Hande Yaman - 155-171 A measure space approach to optimal source placement
by Christian Clason & Karl Kunisch - 173-206 A general theorem on error estimates with application to a quasilinear elliptic optimal control problem
by Eduardo Casas & Fredi Tröltzsch - 207-226 Convergence of the forward-backward sweep method in optimal control
by Michael McAsey & Libin Mou & Weimin Han - 227-248 Balanced POD for linear PDE robust control computations
by John Singler & Belinda Batten - 249-270 A hybrid ODE-based method for unconstrained optimization problems
by Yi-gui Ou & Guan-shu Wang - 271-295 A multi-swarm PSO using charged particles in a partitioned search space for continuous optimization
by Abbas El Dor & Maurice Clerc & Patrick Siarry