scientific article; zbMATH DE number 3898623
From MaRDI portal
Publication:3677522
zbMATH Open0563.90085MaRDI QIDQ3677522FDOQ3677522
Authors: Andreas Griewank, Philippe L. Toint 
Publication date: 1982
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 3843081
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
- Exploiting problem structure in pattern search methods for unconstrained optimization
- Variable metrid method for minimization of partially separable nonsmooth functions
- scientific article; zbMATH DE number 1069181
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cited In (38)
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- Optimization techniques for tree-structured nonlinear problems
- Separation process optimization calculations
- A sequential approach for unconstrained optimization via a partitioning technique
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- Recognizing underlying sparsity in optimization
- On large scale nonlinear network optimization
- Title not available (Why is that?)
- Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations
- Element-by-Element Preconditioners for Large Partially Separable Optimization Problems
- On diagonally structured problems in unconstrained optimization using an inexact super Halley method
- Reformulations for utilizing separability when solving convex MINLP problems
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
- Approximating Hessians in unconstrained optimization arising from discretized problems
- Pattern graph for sparse Hessian matrix determination
- ve08
- Title not available (Why is that?)
- Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
- Computing the sparsity pattern of Hessians using automatic differentiation
- Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training
- On the existence of convex decompositions of partially separable functions
- Optimizing partially separable functions without derivatives
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Title not available (Why is that?)
- Subdomain separability in global optimization
- Learning general sparse additive models from point queries in high dimensions
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
- Partitioned variable metric updates for large structured optimization problems
- Recent progress in unconstrained nonlinear optimization without derivatives
- Sparse quasi-Newton updates with positive definite matrix completion
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
- The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Optimization problems with unimodal functions in max-separabal constraints
- Local convergence analysis for partitioned quasi-Newton updates
- Unconstrained duals to partially separable constrained programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677522)
