default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOptimization Methods and Software, Volume 32
Volume 32, Number 1, 2017
- Paul Armand, Riadh Omheni:
A globally and quadratically convergent primal-dual augmented Lagrangian algorithm for equality constrained optimization. 1-21 - Roberto Andreani, Roger Behling, Gabriel Haeser
, Paulo J. S. Silva:
On second-order optimality conditions in nonlinear optimization. 22-38 - Kai Wang, Jitamitra Desai, Hongjin He:
A proximal partially parallel splitting method for separable convex programs. 39-68 - Zhichuan Zhu, Bo Yu:
Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming. 69-85 - Miguel Cea:
Optimal design for 2D wave equations. 86-108 - Michael Orlitzky:
The Lyapunov rank of an improper cone. 109-125 - Yue Teng, Li Yang, Bo Yu, Xiaoliang Song:
A penalty PALM method for sparse portfolio selection problems. 126-147 - Frank E. Curtis, Tim Mitchell, Michael L. Overton:
A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles. 148-181 - Raweerote Suparatulatorn, Prasit Cholamjiak, Suthep Suantai:
On solving the minimization problem and the fixed-point problem for nonexpansive mappings in CAT(0) spaces. 182-192 - A. Dehghani, Jean-Louis Goffin, Dominique Orban:
A primal-dual regularized interior-point method for semidefinite programming. 193-219
Volume 32, Number 2, 2017
- Panos M. Pardalos, Valeriy A. Kalyagin:
Preface. 221 - Konstantin Avrachenkov, Pavel Yu. Chebotarev, Alexey Mishenin:
Semi-supervised learning with regularized Laplacian. 222-236 - Robin C. Gilbert, Theodore B. Trafalis, Michael B. Richman, Lance M. Leslie:
A data-driven kernel method assimilation technique for geophysical modelling. 237-249 - Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
Robustness of solutions to critical node detection problems with imperfect data: a computational study. 250-273 - Anna Pirova, Iosif B. Meyerov, Evgeniy Kozinov, Sergey Lebedev:
PMORSy: parallel sparse matrix ordering software for fill-in minimization. 274-289 - Mohammadreza Samadi, Alexander G. Nikolaev, Rakesh Nagi:
The temporal aspects of the evidence-based influence maximization on social networks. 290-311 - Pablo San Segundo, Jorge Artieda, Mikhail Batsyn, Panos M. Pardalos:
An enhanced bitstring encoding for exact maximum clique search in sparse graphs. 312-335 - Vladimir Stozhkov, Grigory Pastukhov, Vladimir Boginski, Eduardo L. Pasiliao:
New analytical lower bounds on the clique number of a graph. 336-368 - Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
Finding groups with maximum betweenness centrality. 369-399
Volume 32, Number 3, 2017
- Sina Khoshfetrat Pakazad, Anders Hansson, Martin S. Andersen, Isak Nielsen:
Distributed primal-dual interior-point methods for solving tree-structured coupled convex problems using message-passing. 401-435 - Ondrej Santin, Marta Jarosová, Vladimír Havlena, Zdenek Dostál:
Proportioning with second-order information for model predictive control. 436-454 - George Kolomvos, Georgios K. D. Saharidis:
Accelerating techniques on nested decomposition. 455-469 - F. Q. Xia, Qamrul Hasan Ansari, Jen-Chih Yao:
A new incremental constraint projection method for solving monotone variational inequalities. 470-502 - Jinbao Jian, Qian Chen, Xianzhen Jiang, You-Fang Zeng, Jianghua Yin:
A new spectral conjugate gradient method for large-scale unconstrained optimization. 503-515 - Liang Chen, Cuizhen Du, Yanfang Ma:
The higher-order Levenberg-Marquardt method with Armijo type line search for nonlinear equations. 516-533 - Neculai Andrei:
Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization. 534-551 - Rommel G. Regis, Stefan M. Wild:
CONORBIT: constrained optimization by radial basis function interpolation in trust regions. 552-580 - Minghai Yuan, Kun Deng, W. Art Chaovalitwongse, Shuo Cheng:
Multi-objective optimal scheduling of reconfigurable assembly line for cloud manufacturing. 581-593 - Guillaume Aupy, Julien Herrmann:
Periodicity in optimal hierarchical checkpointing schemes for adjoint computations. 594-624 - Xuehao Feng, Yuna Lee, Ilkyeong Moon:
An integer program and a hybrid genetic algorithm for the university timetabling problem. 625-649 - Lei Zhu, Bo Yu, Liyan Xu:
The distributionally robust complementarity problem. 650-668
Volume 32, Number 4, 2017
Editorial
- Panos Parpas, Berç Rustem, Wolfram Wiesemann:
Guest Editorial. 669
- Sebastian Albrecht, Michael Ulbrich:
Mathematical programs with complementarity constraints in the context of inverse optimal control for locomotion. 670-698 - Halil I. Bayrak, Kemal Güler, Mustafa Ç. Pinar:
Optimal allocation with costly inspection and discrete types under ambiguity. 699-718 - Pedro M. Castro:
Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation. 719-737 - Anulekha Dhara, Karthik Natarajan:
On the polynomial solvability of distributionally robust k-sum optimization. 738-753 - Sören Geffken, Christof Büskens:
Feasibility refinement in sequential quadratic programming using parametric sensitivity analysis. 754-769 - Shaoyan Guo, Huifu Xu, Liwei Zhang:
Probability approximation schemes for stochastic programs with distributionally robust second-order dominance constraints. 770-789 - Daniel Kraft:
Self-consistent gradient flow for shape optimization. 790-812 - Chenxin Ma, Jakub Konecný, Martin Jaggi, Virginia Smith, Michael I. Jordan, Peter Richtárik, Martin Takác:
Distributed optimization with arbitrary local solvers. 813-848 - Jakub Marecek, Martin Takác:
A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow. 849-871 - Dimitrios Nerantzis, Claire S. Adjiman:
An interval-matrix branch-and-bound algorithm for bounding eigenvalues. 872-891 - Viet Hung Nguyen, Michel Minoux:
Improved linearized models for graph partitioning problem under capacity constraints. 892-903 - Sebastian Pfaff, Stefan Ulbrich:
Optimal control of scalar conservation laws by on/off-switching. 904-939 - Radoslaw Pytlak, Damian Suski:
On solving hybrid optimal control problems with higher index DAEs. 940-962 - Anthony Man-Cho So, Zirui Zhou:
Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity. 963-992
Volume 32, Number 5, 2017
- Jakub Konecný, Zheng Qu, Peter Richtárik:
Semi-stochastic coordinate descent. 993-1005 - Vincent Guigues, René Henrion:
Joint dynamic probabilistic constraints with projected linear decision rules. 1006-1032 - Vincent Guigues, Anatoli B. Juditsky, Arkadi Nemirovski:
Non-asymptotic confidence bounds for the optimal value of a stochastic program. 1033-1058 - Yong Hsia, Ruey-Lin Sheu, Ya-Xiang Yuan:
Theory and application of p-regularized subproblems for p>2. 1078-1094
- Masoud Fatemi:
A scaled conjugate gradient method for nonlinear unconstrained optimization. 1095-1112 - Xiaokai Chang, Sanyang Liu:
A feasible method for sensor network localization. 1113-1131 - Lars Lubkoll, Anton Schiela, Martin Weiser:
An affine covariant composite step method for optimization with PDEs as equality constraints. 1132-1161
Volume 32, Number 6, 2017
- E. Alper Yildirim:
Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis. 1163-1186 - Guanglin Xu, Samuel Burer:
Robust sensitivity analysis of the optimal value of linear programming. 1187-1205 - Hasan Bulut:
Multiloop transportation simplex algorithm. 1206-1217 - Olga I. Kostyukova, Tatiana V. Tchemisova, M. A. Kurdina:
A study of one class of NLP problems arising in parametric semi-infinite programming. 1218-1243 - Oliver Kolossoski, Renato D. C. Monteiro:
An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems. 1244-1272 - Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients. 1273-1298 - Ahmad Alhawarat, Zabidin Salleh, Mustafa Mamat, Mohd Rivaie:
An efficient modified Polak-Ribière-Polyak conjugate gradient method with global convergence properties. 1299-1312 - Hiroshi Kobayashi, Yasushi Narushima, Hiroshi Yabe:
Descent three-term conjugate gradient methods based on secant conditions for unconstrained optimization. 1313-1329
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-11-18 20:34 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:
