default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 53
Volume 53, Number 1, September 2012
- Nicholas I. M. Gould
, Margherita Porcelli, Philippe L. Toint:
Updating the regularization parameter in the adaptive cubic regularization algorithm. 1-22 - Ting Kei Pong:
Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints. 23-44 - Huiling Lin:
An inexact spectral bundle method for convex quadratic semidefinite programming. 45-89 - Ting-Jang Shiu, Soon-Yi Wu:
Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems. 91-113 - Zhe Liu, Yahya Fathi:
The nearest point problem in a polyhedral set and its extensions. 115-130 - Burak Ayar, Hande Yaman:
An intermodal multicommodity routing problem with scheduled services. 131-153 - Christian Clason, Karl Kunisch:
A measure space approach to optimal source placement. 155-171 - Eduardo Casas, Fredi Tröltzsch:
A general theorem on error estimates with application to a quasilinear elliptic optimal control problem. 173-206 - Michael McAsey, Libin Mou, Weimin Han:
Convergence of the forward-backward sweep method in optimal control. 207-226 - John R. Singler, Belinda A. Batten:
Balanced POD for linear PDE robust control computations. 227-248 - Yi-gui Ou, Guan-shu Wang:
A hybrid ODE-based method for unconstrained optimization problems. 249-270 - Abbas El Dor, Maurice Clerc, Patrick Siarry:
A multi-swarm PSO using charged particles in a partitioned search space for continuous optimization. 271-295
Volume 53, Number 2, October 2012
- Gianni Di Pillo, Massimo Roma:
Guest editorial. 297-299 - Annabella Astorino, Antonio Fuduli, Manlio Gaudioso:
Margin maximization in spherical separation. 301-322 - Giancarlo Bigi, Mauro Passacantando:
Gap functions and penalization for solving equilibrium problems with nonlinear constraints. 323-346 - Ernesto G. Birgin, Jan M. Gentil:
Evaluating bound-constrained minimization software. 347-373 - Mahdi Boukrouche, Domingo A. Tarzia:
Convergence of distributed optimal control problems governed by elliptic variational inequalities. 375-393 - Marianna De Santis, Gianni Di Pillo, Stefano Lucidi:
An active set feasible method for large-scale minimization problems with bound constraints. 395-423 - Alexey F. Izmailov, A. L. Pogosyan:
Active-set Newton methods for mathematical programs with vanishing constraints. 425-452 - Nils Langenberg:
Interior point methods for equilibrium problems. 453-483 - M. Beatrice Lignola, Jacqueline Morgan:
Approximate values for mathematical programs with variational inequality constraints. 485-503 - Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi:
Derivative-free methods for bound constrained mixed-integer optimization. 505-526 - M. J. D. Powell:
On the convergence of trust region algorithms for unconstrained minimization without derivatives. 527-555 - Saverio Salzo, Silvia Villa:
Convergence analysis of a proximal Gauss-Newton method. 557-589 - Valeria Simoncini:
Reduced order solution of structured linear systems arising in certain PDE-constrained optimization problems. 591-617 - Levent Tunçel, Henry Wolkowicz:
Strong duality and minimal representations for cone optimization. 619-648
Volume 53, Number 3, December 2012
- Marco Di Summa, Andrea Grosso, Marco Locatelli:
Branch and cut algorithms for detecting critical nodes in undirected graphs. 649-680 - Walter Murray, Howard Shek:
A local relaxation method for the cardinality constrained portfolio optimization problem. 681-709 - Paul J. Sutcliffe, Andrew Solomon, Jenny Edwards:
Computing the variance of tour costs over the solution space of the TSP in polynomial time. 711-728 - Kerem Akartunali, Andrew J. Miller:
A computational analysis of lower bounds for big bucket production planning problems. 729-753 - Marc Fuentes, Jérôme Malick, Claude Lemaréchal:
Descentwise inexact proximal algorithms for smooth optimization. 755-769 - Stefania Bellavia, Maria Macconi, Sandra Pieraccini:
Constrained Dogleg methods for nonlinear systems with simple bounds. 771-794 - Zhaocheng Cui, Boying Wu:
A new modified nonmonotone adaptive trust region method for unconstrained optimization. 795-806 - H. L. Luo, X. X. Huang, J. W. Peng:
Generalized weak sharp minima in cone-constrained convex optimization with applications. 807-821 - Hayato Waki, Maho Nakata, Masakazu Muramatsu:
Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization. 823-844 - Yuning Yang, Qingzhi Yang:
On solving biquadratic optimization via semidefinite relaxation. 845-867 - Kalyanmoy Deb, Soumil Srivastava:
A genetic algorithm based augmented Lagrangian method for constrained optimization. 869-902 - Edoardo Patelli, Gerhart I. Schuëller:
Computational optimization strategies for the simulation of random media and components. 903-931
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.
last updated on 2024-10-31 20:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
