Variable Metric Method for Minimization
From MaRDI portal
Publication:4017634
DOI10.1137/0801001zbMath0752.90062OpenAlexW2042803051WikidataQ29035903 ScholiaQ29035903MaRDI QIDQ4017634
Publication date: 16 January 1993
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc1020493/
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization, Recent advances in unconstrained optimization, Non-asymptotic superlinear convergence of standard quasi-Newton methods, Quasi-Newton algorithms for solving interval-valued multiobjective optimization problems by using their certain equivalence, A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations, A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications, Derivation of coordinate descent algorithms from optimal control theory, Simulating comparisons of different computing algorithms fitting zero-inflated Poisson models for zero abundant counts, A novel iterative learning control scheme based on Broyden‐class optimization method, Addressing discontinuous root-finding for subsequent differentiability in machine learning, inverse problems, and control, A \(J\)-symmetric quasi-Newton method for minimax problems, Randomized Quasi-Newton Updates Are Linearly Convergent Matrix Inversion Algorithms, Quasi-newton algorithms generate identical points, Minimizing oracle-structured composite functions, Greedy PSB methods with explicit superlinear convergence, Parallel tangents and steepest descent optimization algorithm-a computer implementation with application to linear, partially linear models and qualitative data†, An overview of nonlinear optimization, A superlinearly convergent method for minimization problems with linear inequality constraints, A Class of Methods for Solving Nonlinear Simultaneous Equations, Doubly inflated Poisson model using Gaussian copula, Oblique projections, Broyden restricted class and limited-memory quasi-Newton methods, Unconstrained optimization based on homogeneous models, Computational micro-macro material testing, Second-order adjoints for solving PDE-constrained optimization problems, Generating conjugate directions without line searches using factorized variable metric updating formulas, Optimal conditioning in the convex class of rank two updates, Variable metric forward–backward splitting with applications to monotone inclusions in duality, A Quasi-Newton Method with No Derivatives, Greedy Quasi-Newton Methods with Explicit Superlinear Convergence, A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization, Computational experience with known variable metric updates, On obtaining sparse semantic solutions for inverse problems, control, and neural network training, Additive models with autoregressive symmetric errors based on penalized regression splines, Dual techniques for constrained optimization, A scaled three-term conjugate gradient method for unconstrained optimization, A truncated Newton optimization algorithm in meteorology applications with analytic Hessian/vector products, A computational method for full waveform inversion of crosswell seismic data using automatic differentiation, OPTIMASS: a package for the minimization of kinematic mass functions with constraints, Limited-memory BFGS with displacement aggregation, Rates of superlinear convergence for classical quasi-Newton methods, Annealing stochastic approximation Monte Carlo algorithm for neural network training, Bilevel direct search method for leader-follower problems and application in health insurance, Parallel variable metric algorithms for unconstrained optimization, Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems, Benefits of noise in M-estimators: optimal noise level and probability density, Subdivision schemes for positive definite matrices, A modified nonmonotone BFGS algorithm for unconstrained optimization, The global convergence of a modified BFGS method for nonconvex functions, A derivative-free optimization algorithm based on conditional moments, Broad echo state network for multivariate time series prediction, An optimal control theory for nonlinear optimization, The projection technique for two open problems of unconstrained optimization problems, A compact updating formula for quasi-Newton minimization algorithms, Nonmonotone BFGS-trained recurrent neural networks for temporal sequence processing, Mesh adaptive direct search with second directional derivative-based Hessian update, A perfect example for the BFGS method, An active set limited memory BFGS algorithm for bound constrained optimization, A variable metric algorithm for unconstrained minimization without evaluation of derivatives, The quadratic dimensional reduction method for parameter identification, Superlinear convergence of symmetric Huang's class of methods, Projection methods for non-linear programming, The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods, Partitioned variable metric updates for large structured optimization problems, Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions, Numerical reduced variable optimization methods via implicit functional dependence with applications, Generalized conjugate directions for unconstrained function minimization, Conditions for variable-metric algorithms to be conjugate-gradient algorithms, Karmarkar's linear programming algorithm and Newton's method, Cubic regularization in symmetric rank-1 quasi-Newton methods, Optimally conditioned optimization algorithms without line searches, Practical convergence conditions for the Davidon-Fletcher-Powell method, Partitioned simulation of fluid-structure interaction. Coupling black-box solvers with quasi-Newton techniques, Bayesian inference of a parametric random spheroid from its orthogonal projections, An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods, The dimensional reduction method for identification of parameters that trade-off due to similar model roles, On exact linesearch quasi-Newton methods for minimizing a quadratic function, The price adjustment hazard function: evidence from high inflation periods, On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class, Maximum likelihood estimation of Hawkes' self-exciting point processes, Supermemory descent methods for unconstrained minimization, On quasi-Newton and pseudo-Newton algorithms, Superlinearly convergent variable metric algorithms for general nonlinear programming problems, New quasi-Newton methods for unconstrained optimization problems, A method for determining the equilibrium states of dynamic systems, Approximation methods for the unconstrained optimization, Explicit pseudo-transient continuation and the trust-region updating strategy for unconstrained optimization, A computational method for minimization with nonlinear constraints, On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory, On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications, New results on superlinear convergence of classical quasi-Newton methods, Large-scale linearly constrained optimization, Time evolutional analysis of nonlinear structures, Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs, Experimental Investigation of Local Searches for Optimization of Grillage-Type Foundations, Some remarks on the symmetric rank-one update, Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search, A family of variable metric updates, Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function, Testing a simple structure hypothesis in factor analysis, On the use of function-values in unconstrained optimisation, On averaging and representation properties of the BFGS and related secant updates, Unified approach to quadratically convergent algorithms for function minimization, Nonlinear programming: A quadratic analysis of ridge paralysis, Fitting experimental data, New iterative methods for solution of the eigenproblem, On variable-metric algorithms, The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications, Properties of the conjugate-gradient and Davidon methods, Constrained optimization problems using multiplier methods, Quasi-Newton methods for saddlepoints, Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions, Orthogonalizing linear operators in convex programming. I, II, A pseudo Newton-Raphson method for function minimization, Maximum Entropy Derivation of Quasi-Newton Methods, Quadratically convergent algorithms and one-dimensional search schemes, Stability of Huang's update for the conjugate gradient method, A new approach to constrained function optimization, Computational schemes of the Davidon-Fletcher-Powell method in infinite- dimensional space, Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints, Generalized Hamming networks and applications, An evolutionary programming algorithm for continuous global optimization, Computational performance of Huang's symmetric update for the conjugate gradient method, A variable-metric method using a nonquadratic model, On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems, Optimal load frequency control with governor backlash, Direct search methods: Then and now, An alternative variational principle for variable metric updating, Analysis and implementation of a dual algorithm for constrained optimization, Variable metric random pursuit
