Variable Metric Method for Minimization
From MaRDI portal
Publication:4017634
DOI10.1137/0801001zbMATH Open0752.90062OpenAlexW2042803051WikidataQ29035903 ScholiaQ29035903MaRDI QIDQ4017634FDOQ4017634
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/
Recommendations
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cited In (only showing first 100 items - show all)
- Generating conjugate directions without line searches using factorized variable metric updating formulas
- The global convergence of a modified BFGS method for nonconvex functions
- Variable metric random pursuit
- Orthogonalizing linear operators in convex programming. I, II
- An evolutionary programming algorithm for continuous global optimization
- Vector Assessment of Problematic Situations
- Time evolutional analysis of nonlinear structures
- Recent advances in unconstrained optimization
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- Variable metric forward–backward splitting with applications to monotone inclusions in duality
- On variable-metric algorithms
- An active set limited memory BFGS algorithm for bound constrained optimization
- Constrained optimization problems using multiplier methods
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Algorithm 630
- A superlinearly convergent method for minimization problems with linear inequality constraints
- Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints
- Projection methods for non-linear programming
- Unified approach to quadratically convergent algorithms for function minimization
- Additive models with autoregressive symmetric errors based on penalized regression splines
- Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function
- Dual techniques for constrained optimization
- Annealing stochastic approximation Monte Carlo algorithm for neural network training
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
- Optimal conditioning in the convex class of rank two updates
- On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems
- Second-order adjoints for solving PDE-constrained optimization problems
- A derivative-free optimization algorithm based on conditional moments
- Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization
- A computational method for full waveform inversion of crosswell seismic data using automatic differentiation
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Large-scale linearly constrained optimization
- Preconditioning of a generalized forward-backward splitting and application to optimization on graphs
- 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
- On averaging and representation properties of the BFGS and related secant updates
- A variable metric algorithm for unconstrained minimization without evaluation of derivatives
- Parallel variable metric algorithms for unconstrained optimization
- Superlinear convergence of symmetric Huang's class of methods
- Supermemory descent methods for unconstrained minimization
- On exact linesearch quasi-Newton methods for minimizing a quadratic function
- Unconstrained optimization based on homogeneous models
- Direct search methods: Then and now
- Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems
- Bilevel direct search method for leader-follower problems and application in health insurance
- A new approach to constrained function optimization
- Nonmonotone BFGS-trained recurrent neural networks for temporal sequence processing
- Quasi-Newton methods for saddlepoints
- Mesh adaptive direct search with second directional derivative-based Hessian update
- New quasi-Newton methods for unconstrained optimization problems
- Analysis and implementation of a dual algorithm for constrained optimization
- Maximum likelihood estimation of Hawkes' self-exciting point processes
- A compact updating formula for quasi-Newton minimization algorithms
- Optimally conditioned optimization algorithms without line searches
- Partitioned simulation of fluid-structure interaction. Coupling black-box solvers with quasi-Newton techniques
- Subdivision schemes for positive definite matrices
- Partitioned variable metric updates for large structured optimization problems
- A variable-metric method using a nonquadratic model
- Computational micro-macro material testing
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
- Optimal load frequency control with governor backlash
- Quadratically convergent algorithms and one-dimensional search schemes
- 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
- The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- Quasi-newton algorithms generate identical points
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- OPTIMASS: a package for the minimization of kinematic mass functions with constraints
- Title not available (Why is that?)
- The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications
- Practical convergence conditions for the Davidon-Fletcher-Powell method
- Properties of the conjugate-gradient and Davidon methods
- Karmarkar's linear programming algorithm and Newton's method
- New iterative methods for solution of the eigenproblem
- On the use of function-values in unconstrained optimisation
- Generalized Hamming networks and applications
- A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications
- A computational method for minimization with nonlinear constraints
- Numerical reduced variable optimization methods via implicit functional dependence with applications
- Some remarks on the symmetric rank-one update
- Greedy Quasi-Newton Methods with Explicit Superlinear Convergence
- Cubic regularization in symmetric rank-1 quasi-Newton methods
- Oblique projections, Broyden restricted class and limited-memory quasi-Newton methods
- Simulating comparisons of different computing algorithms fitting zero-inflated Poisson models for zero abundant counts
- An alternative variational principle for variable metric updating
- Maximum entropy derivation of quasi-Newton methods
- An optimal control theory for nonlinear optimization
- Title not available (Why is that?)
- A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations
- Computational experience with known variable metric updates
- A pseudo Newton-Raphson method for function minimization
- Computational schemes of the Davidon-Fletcher-Powell method in infinite- dimensional space
- Non-asymptotic superlinear convergence of standard quasi-Newton methods
- A two-metric variable scaled forward-backward algorithm for \(\ell_0\) optimization problem and its applications
- Stability of Huang's update for the conjugate gradient method
- A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization
- Parallel tangents and steepest descent optimization algorithm-a computer implementation with application to linear, partially linear models and qualitative data†
This page was built for publication: Variable Metric Method for Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017634)
