A New Algorithm for Unconstrained Optimization
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A new backtracking inexact BFGS method for symmetric nonlinear equations
- On the calculation of energy-minimizing phase fractions in shape memory alloys
- Separation process optimization calculations
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Some efficient algorithms for unconstrained discrete-time optimal control problems
- Generalized descent for global optimization
- Some properties of a uniformly linearly independent sequence of subspaces
- Automatic learning of fuzzy naming relations over finite languages
- Convergence of quasi-Newton matrices generated by the symmetric rank one update
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- On the convergence of a class of derivative-free minimization algorithms
- Numerical comparison of several variable metric algorithms
- Censored regression models with unobserved, stochastic censoring thresholds
- Two new unconstrained optimization algorithms which use function and gradient values
- A chordal preconditioner for large-scale optimization
- Advances in trust region algorithms for constrained optimization
- On a class fo hybrid methods for smooth constrained optimization
- Recent progress in unconstrained nonlinear optimization without derivatives
- Variable metric methods for unconstrained optimization and nonlinear least squares
- A new adaptive trust region algorithm for optimization problems
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
- A novel parameter estimation method for muskingum model using new Newton-type trust region algorithm
- An effective adaptive trust region algorithm for nonsmooth minimization
- On the numerical integration of trimmed isogeometric elements
- An efficient trust region method for unconstrained discrete-time optimal control problems
- Pseudorandom lattices for global optimization
- A quasi-Newton strategy for the SSQP method for variational inequality and optimization problems
- A Newton-like trust region method for large-scale unconstrained nonconvex minimization
- A new nonmonotone trust region Barzilai-Borwein method for unconstrained optimization problems
- Secant update generalized version of PSB: a new approach
- An efficient line search trust-region for systems of nonlinear equations
- An adaptive trust-region method without function evaluations
- A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization
- The projection technique for two open problems of unconstrained optimization problems
- Diagonal quasi-Newton methods via least change updating principle with weighted Frobenius norm
- Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- Secant update version of quasi-Newton PSB with weighted multisecant equations
- An improved nonmonotone adaptive trust region method.
- An improved hybrid-ORBIT algorithm based on point sorting and MLE technique
- Recent advances in trust region algorithms
- A wedge trust region method with self-correcting geometry for derivative-free optimization
- Calibration by optimization without using derivatives
- A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization
- On efficiently combining limited-memory and trust-region techniques
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- The global convergence of a modified BFGS method for nonconvex functions
- A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques
- A modified trust region method with beale's PCG technique for optimization
- A new non-monotone self-adaptive trust region method for unconstrained optimization
- On the use of simplex methods in constructing quadratic models
- New quasi-Newton methods for unconstrained optimization problems
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- New line search methods for unconstrained optimization
- A variant of trust-region methods for unconstrained optimization
- A limited memory quasi-Newton trust-region method for box constrained optimization
- A limited-memory trust-region method for nonlinear optimization with many equality constraints
- Maximum entropy derivation of quasi-Newton methods
- Arbitrarily slow convergence of sequences of linear operators: a survey
- Full waveform inversion and the truncated Newton method
- Optimization algorithms
- A stabilized filter SQP algorithm for nonlinear programming
- Modification Methods for Inverting Matrices and Solving Systems of Linear Algebraic Equations
- A Sparse Quasi-Newton Update Derived Variationally with a Nondiagonally Weighted Frobenius Norm
- Local and superlinear convergence for truncated iterated projections methods
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- On Variable-Metric Methods for Sparse Hessians
- Combined lp and quasi-Newton methods for minimax optimization
- A model-hybrid approach for unconstrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- The estimation of the hessian matrix in nonlinear least squares problems with non-zero residuals
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Inexact trust region PGC method for large sparse unconstrained optimization
- scientific article; zbMATH DE number 1014733 (Why is no real title available?)
- scientific article; zbMATH DE number 1014734 (Why is no real title available?)
- Survey of multifidelity methods in uncertainty propagation, inference, and optimization
- A quasi-Newton modified LP-Newton method
- Low rank updates in preconditioning the saddle point systems arising from data assimilation problems
- Symmetric minimum-norm updates for use in gibbs free energy calculations
- Partially symmetrical derivative-free Liu-Storey projection method for convex constrained equations
- Partitioned simulation of fluid-structure interaction. Coupling black-box solvers with quasi-Newton techniques
- A symmetric grouped and ordered multi-secant Quasi-Newton update formula
- Stochastic trust-region methods with trust-region radius depending on probabilistic models
- A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
- A new self-adaptive trust region method for unconstrained optimization
- A practical method for solving large-scale TRS
- Applying powell's symmetrical technique to conjugate gradient methods
- Recent advances in unconstrained optimization
- Methods of conjugate directions versus quasi-Newton methods
- An algorithm for solving linearly constrained optimization problems
- Adaptive trust-region algorithms for unconstrained optimization
- On the robustness of inverse scattering for penetrable, homogeneous objects with complicated boundary
- ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints
- Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence
- Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization
- A new multipoint symmetric secant method with a dense initial matrix
- A J-symmetric quasi-Newton method for minimax problems
This page was built for publication: A New Algorithm for Unconstrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5636702)