ve08
From MaRDI portal
Software:17281
No author found.
Related Items (only showing first 100 items - show all)
An H-form variant of the partitioned QN method ⋮ Nonlinear model predictive control via feasibility-perturbed sequential quadratic programming ⋮ Sparsity in higher order methods for unconstrained optimization ⋮ A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems ⋮ The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study ⋮ Corrected sequential linear programming for sparse minimax optimization ⋮ Unnamed Item ⋮ On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization ⋮ A parallel quasi-Newton algorithm for unconstrained optimization ⋮ Separation process optimization calculations ⋮ Rates of superlinear convergence for classical quasi-Newton methods ⋮ Unnamed Item ⋮ Convergence theory for the structured BFGS secant method with an application to nonlinear least squares ⋮ Recent progress in unconstrained nonlinear optimization without derivatives ⋮ Unnamed Item ⋮ The global convergence of the BFGS method with a modified WWP line search for nonconvex functions ⋮ Unnamed Item ⋮ Difference Newton-like methods under weak continuity conditions ⋮ Local Convergence of Secant Methods for Nonlinear Constrained Optimization ⋮ Unnamed Item ⋮ Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization ⋮ The global convergence of a modified BFGS method for nonconvex functions ⋮ A trust-region-based BFGS method with line search technique for symmetric nonlinear equations ⋮ Local Convergence Theory of Inexact Newton Methods Based on Structured Least Change Updates ⋮ A Broyden Class of Quasi-Newton Methods for Riemannian Optimization ⋮ The global convergence of the BFGS method under a modified Yuan-Wei-Lu line search technique ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians ⋮ Unnamed Item ⋮ A note on solving nonlinear optimization problems in variable precision ⋮ The projection technique for two open problems of unconstrained optimization problems ⋮ Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds ⋮ An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix ⋮ Unnamed Item ⋮ On diagonally structured problems in unconstrained optimization using an inexact super Halley method ⋮ On large scale nonlinear network optimization ⋮ On the limited memory BFGS method for large scale optimization ⋮ Approximating Hessians in unconstrained optimization arising from discretized problems ⋮ An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints ⋮ A conjugate directions approach to improve the limited-memory BFGS method ⋮ Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares ⋮ Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods ⋮ Optimization techniques for tree-structured nonlinear problems ⋮ Algorithm 896 ⋮ The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions ⋮ Unnamed Item ⋮ Sparse quasi-Newton updates with positive definite matrix completion ⋮ On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems ⋮ The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients ⋮ Convergence of quasi-Newton matrices generated by the symmetric rank one update ⋮ A partitioned PSB method for partially separable unconstrained optimization problems ⋮ A family of the local convergence of the improved secant methods for nonlinear equality constrained optimization subject to bounds on variables ⋮ Analysis of sparse quasi-Newton updates with positive definite matrix completion ⋮ The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions ⋮ Graph coloring in the estimation of sparse derivative matrices: Instances and applications ⋮ On large-scale unconstrained optimization problems and higher order methods ⋮ Survey of trust-region derivative free optimization methods ⋮ Unconstrained duals to partially separable constrained programs ⋮ Partitioned quasi-Newton methods for sparse nonlinear equations ⋮ The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization ⋮ Unnamed Item ⋮ MODIFIED LIMITED MEMORY BFGS METHOD WITH NONMONOTONE LINE SEARCH FOR UNCONSTRAINED OPTIMIZATION ⋮ A Quasi-Newton Method for Elliptic Boundary Value Problems ⋮ Global convergence of the partitioned BFGS algorithm for convex partially separable optimization ⋮ Unnamed Item ⋮ Learning general sparse additive models from point queries in high dimensions ⋮ An implementation of Newton-like methods on nonlinearly constrained networks ⋮ Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization ⋮ Unnamed Item ⋮ New quasi-Newton methods for unconstrained optimization problems ⋮ A nonmonotone Broyden method for unconstrained optimization ⋮ Convergence analysis of a modified BFGS method on convex minimizations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 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 ⋮ Large scale portfolio optimization with piecewise linear transaction costs ⋮ New results on superlinear convergence of classical quasi-Newton methods ⋮ New line search methods for unconstrained optimization ⋮ Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion ⋮ Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search ⋮ Estimating reducible stochastic differential equations by conversion to a least-squares problem ⋮ Recognizing underlying sparsity in optimization ⋮ A unified convergence framework for nonmonotone inexact decomposition methods ⋮ Solving reachability problems by a scalable constrained optimization method ⋮ Unnamed Item ⋮ Preconditioner updates for solving sequences of linear systems in matrix-free environment ⋮ Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP ⋮ Global convergence of a class of collinear scaling algorithms with inexact line searches on convex functions ⋮ Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization ⋮ A new backtracking inexact BFGS method for symmetric nonlinear equations ⋮ Unnamed Item ⋮ A two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squares ⋮ Automatic differentiation for solving nonlinear partial differential equations: an efficient operator overloading approach ⋮ The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden ⋮ Numerical methods for large-scale nonlinear optimization ⋮ Variable metric methods for unconstrained optimization and nonlinear least squares ⋮ Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations
This page was built for software: ve08
