ve08

swMATH5141MaRDI QIDQ17281FDOQ17281

Author name not available (Why is that?)

Official website: https://www.netlib.org/opt/ve08

Described by source

• Unnamed Publication
• Partitioned variable metric updates for large structured optimization problems
• Local convergence analysis for partitioned quasi-Newton updates

Cited In (only showing first 100 items - show all)

• Title not available (Why is that?)
• 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
• 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
• Modified limited memory BFGS method with nonmonotone line search for unconstrained optimization
• The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
• An H-form variant of the partitioned QN method
• A Quasi-Newton Method for Elliptic Boundary Value Problems
• Title not available (Why is that?)
• Survey of trust-region derivative free optimization methods
• On large scale nonlinear network optimization
• Reformulations for utilizing separability when solving convex MINLP problems
• Local Convergence of Secant Methods for Nonlinear Constrained Optimization
• Local Convergence Theory of Inexact Newton Methods Based on Structured Least Change Updates
• The global convergence of the BFGS method with a modified WWP line search for nonconvex functions
• A conjugate directions approach to improve the limited-memory BFGS method
• The global convergence of the BFGS method under a modified Yuan-Wei-Lu line search technique
• Difference Newton-like methods under weak continuity conditions
• Title not available (Why is that?)
• On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
• 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
• 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
• Nonlinear model predictive control via feasibility-perturbed sequential quadratic programming
• On the Relation between Two Local Convergence Theories of Least-Change Secant Update Methods
• A trust-region-based BFGS method with line search technique for symmetric nonlinear equations
• 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
• Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
• Stable factorized quasi-Newton methods for nonlinear least-squares problems
• Computing the sparsity pattern of Hessians using automatic differentiation
• An Optimal Positive Definite Update for Sparse Hessian Matrices
• 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?)
• Nonlinear (local) optimization. The state of the art
• A family of the local convergence of the improved secant methods for nonlinear equality constrained optimization subject to bounds on variables
• The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions
• 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
• Analysis of sparse quasi-Newton updates with positive definite matrix completion
• Trust-region interior-point method for large sparsel₁optimization
• Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sparse quasi-Newton updates with positive definite matrix completion
• Inexact Secant Methods for Nonlinear Constrained Optimization
• 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
• A rank-one fitting method for solving symmetric nonlinear equations
• The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization
• Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization
• Partitioned quasi-Newton methods for sparse nonlinear equations
• A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information
• Optimization techniques for tree-structured nonlinear problems
• Adjoint-based SQP method with block-wise quasi-Newton Jacobian updates for nonlinear optimal control
• Determining sparse Jacobian matrices using two-sided compression: an algorithm and lower bounds
• Title not available (Why is that?)
• A nonmonotone Broyden method for unconstrained optimization
• High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
• MINPACK
• 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
• Greedy quasi-Newton methods with explicit superlinear convergence
• New results on superlinear convergence of classical quasi-Newton methods
• 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
• Primal interior point method for minimization of generalized minimax functions
• Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization
• Title not available (Why is that?)
• Graph coloring in the estimation of sparse derivative matrices: Instances and applications
• The projection technique for two open problems of unconstrained optimization problems
• 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
• 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
• 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?)
• On the Behavior of Broyden’s Class of Quasi-Newton Methods
• A hybrid Hooke and Jeeves -- direct method for non-smooth optimization
• Primal interior-point method for large sparse minimax optimization
• Preconditioner updates for solving sequences of linear systems in matrix-free environment
• A new backtracking inexact BFGS method for symmetric nonlinear equations
• 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

This page was built for software: ve08