Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 36
Volume 36, Number 1, January 2007
- Pierre-Antoine Absil, André L. Tits:
Newton-KKT interior-point methods for indefinite quadratic programming. 5-41 - O. L. Mangasarian:
Absolute value programming. 43-53 - Xiaoguang Yang, Jianzhong Zhang:
Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems. 55-66 - Kalpana Dahiya
, Surjeet Kaur Suneja, Vanita Verma:
Convex programming with single separable constraint and bounded variables. 67-82 - Andrea Walther:
Automatic differentiation of explicit Runge-Kutta methods for optimal control. 83-108 - Antje Noack, Andrea Walther:
Adjoint concepts for the optimal control of Burgers equation. 109-133
Volume 36, Numbers 2-3, April 2007
- Luca Bergamaschi, Jacek Gondzio, Manolo Venturin, Giovanni Zilli:
Inexact constraint preconditioners for linear systems arising in interior point methods. 137-147 - Silvana Bocanegra, F. F. Campos, Aurelio R. L. Oliveira:
Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods. 149-164 - Sonia Cafieri, Marco D'Apuzzo, Valentina De Simone, Daniela di Serafino:
Stopping criteria for inner iterations in inexact potential reduction methods: a computational study. 165-193 - Jordi Castro:
An interior-point approach for primal block-angular problems. 195-219 - Joo-Siong Chai, Kim-Chuan Toh:
Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming. 221-247 - H. Sue Dollar, Nicholas I. M. Gould, Wil H. A. Schilders, Andy J. Wathen:
Using constraint preconditioners with regularized saddle-point problems. 249-270 - Antonio Frangioni, Claudio Gentile:
Prim-based support-graph preconditioners for min-cost flow problems. 271-287 - Kazuhiro Kobayashi, Kazuhide Nakata, Masakazu Kojima:
A conversion of an SDP having free variables into the standard form SDP. 289-307 - Csaba Mészáros:
Detecting "dense" columns in interior point methods for linear programs. 309-320 - Olaf Schenk, Andreas Wächter, Michael Hagemann:
Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization. 321-341
a service of 
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-04-22 20:02 CEST 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:
