ve08
From MaRDI portal
Software:17281
swMATH5141MaRDI QIDQ17281FDOQ17281
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Title not available (Why is that?)
- A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information
- The global convergence of a modified BFGS method for nonconvex functions
- The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden
- Optimization techniques for tree-structured nonlinear problems
- A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems
- Separation process optimization calculations
- A partitioned PSB method for partially separable unconstrained optimization problems
- Greedy Quasi-Newton Methods with Explicit Superlinear Convergence
- An H-form variant of the partitioned QN method
- Title not available (Why is that?)
- Title not available (Why is that?)
- On large scale nonlinear network optimization
- Reformulations for utilizing separability when solving convex MINLP problems
- The global convergence of the BFGS method with a modified WWP line search for nonconvex functions
- The global convergence of the BFGS method under a modified Yuan-Wei-Lu line search technique
- Title not available (Why is that?)
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- Global convergence of a class of collinear scaling algorithms with inexact line searches on convex functions
- Exploiting problem structure in pattern search methods for unconstrained optimization
- A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence
- A note on solving nonlinear optimization problems in variable precision
- New results on superlinear convergence of classical quasi-Newton methods
- Nonlinear model predictive control via feasibility-perturbed sequential quadratic programming
- On efficient Hessian computation using the edge pushing algorithm in Julia
- Rates of superlinear convergence for classical quasi-Newton methods
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- Title not available (Why is that?)
- On the Impact of Automatic Differentiation on the Relative Performance of Parallel Truncated Newton and Variable Metric Algorithms
- An implementation of Newton-like methods on nonlinearly constrained networks
- Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions
- Corrected sequential linear programming for sparse minimax optimization
- Stable factorized quasi-Newton methods for nonlinear least-squares problems
- Computing the sparsity pattern of Hessians using automatic differentiation
- Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization
- Nonlinear (local) optimization. The state of the art
- Title not available (Why is that?)
- A parallel quasi-Newton algorithm for unconstrained optimization
- Learning general sparse additive models from point queries in high dimensions
- Trust-region interior-point method for large sparsel1optimization
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
- Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- The projection technique for two open problems of unconstrained optimization problems
- Inexact Secant Methods for Nonlinear Constrained Optimization
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
- A unified convergence framework for nonmonotone inexact decomposition methods
- Solving reachability problems by a scalable constrained optimization method
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
- Title not available (Why is that?)
- Unconstrained duals to partially separable constrained programs
- The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization
- Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization
- Adjoint-based SQP method with block-wise quasi-Newton Jacobian updates for nonlinear optimal control
- Title not available (Why is that?)
- A nonmonotone Broyden method for unconstrained optimization
- Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds
- Title not available (Why is that?)
- Local and Superlinear Convergence for Partially Known Quasi-Newton Methods
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- On the Use of Product Structure in Secant Methods for Nonlinear Least Squares Problems
- Block BFGS Methods
- A two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squares
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Numerical methods for large-scale nonlinear optimization
- Title not available (Why is that?)
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- On the Behavior of Broyden’s Class of Quasi-Newton Methods
- A Quasi-Newton Method for Elliptic Boundary Value Problems
- Preconditioner updates for solving sequences of linear systems in matrix-free environment
- A new backtracking inexact BFGS method for symmetric nonlinear equations
- Algorithm 896
- Survey of trust-region derivative free optimization methods
- Recognizing underlying sparsity in optimization
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Title not available (Why is that?)
- A modified BFGS method and its global convergence in nonconvex minimization
- Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations
- On diagonally structured problems in unconstrained optimization using an inexact super Halley method
- Local Convergence of Secant Methods for Nonlinear Constrained Optimization
- Local Convergence Theory of Inexact Newton Methods Based on Structured Least Change Updates
- A conjugate directions approach to improve the limited-memory BFGS method
- Convergence of quasi-Newton matrices generated by the symmetric rank one update
- Difference Newton-like methods under weak continuity conditions
- Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region
- On Large Scale Nonlinear Least Squares Calculations
- Title not available (Why is that?)
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
- On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
- SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS
- LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- A Class of Trust Region Methods for Nonlinear Network Optimization Problems
- On the Relation between Two Local Convergence Theories of Least-Change Secant Update Methods
- The Local Convergence of Broyden-Like Methods on Lipschitzian Problems in Hilbert Spaces
- Convergence analysis of a modified BFGS method on convex minimizations
- A trust-region-based BFGS method with line search technique for symmetric nonlinear equations
- Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
- New line search methods for unconstrained optimization
This page was built for software: ve08