scientific article
From MaRDI portal
Publication:3677522
zbMath0563.90085MaRDI QIDQ3677522
Andreas Griewank, Phillipe L. Toint
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study, Separation process optimization calculations, Recent progress in unconstrained nonlinear optimization without derivatives, On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians, Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training, Subdomain separability in global optimization, On diagonally structured problems in unconstrained optimization using an inexact super Halley method, On large scale nonlinear network optimization, Partitioned variable metric updates for large structured optimization problems, Approximating Hessians in unconstrained optimization arising from discretized problems, An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints, Optimization techniques for tree-structured nonlinear problems, Sparse quasi-Newton updates with positive definite matrix completion, The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients, Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities, Graph coloring in the estimation of sparse derivative matrices: Instances and applications, Unconstrained duals to partially separable constrained programs, Global convergence of the partitioned BFGS algorithm for convex partially separable optimization, Learning general sparse additive models from point queries in high dimensions, On the existence of convex decompositions of partially separable functions, High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms, Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization, Reformulations for utilizing separability when solving convex MINLP problems, Pattern graph for sparse Hessian matrix determination, Recognizing underlying sparsity in optimization, ve08, Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP, Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables, Local convergence analysis for partitioned quasi-Newton updates, Computing the sparsity pattern of Hessians using automatic differentiation, Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations
