Numerical methods for large-scale nonlinear optimization
From MaRDI portal
Cited in
(61)- A limited memory BFGS-type method for large-scale unconstrained optimization
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
- A primal-dual active set method and predictor-corrector mesh adaptivity for computing fracture propagation using a phase-field approach
- A numerical study on large-scale nonlinear solvers
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- Two-phase-SQP method with higher-order convergence property
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization
- On a primal-dual Newton proximal method for convex quadratic programs
- An active-set algorithm for norm constrained quadratic problems
- Modern numerical nonlinear optimization
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- Newton-type methods: a broader view
- Numerical optimization applying trust-region reflective least squares algorithm with constraints to optimize the non-linear creep parameters of soft soil
- A subspace SQP method for equality constrained optimization
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- The convergence of subspace trust region methods
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
- A limited-memory trust-region method for nonlinear optimization with many equality constraints
- Nonlinear (local) optimization. The state of the art
- Some new facts about sequential quadratic programming methods employing second derivatives
- An adaptive gradient algorithm for large-scale nonlinear bound constrained optimization
- Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems
- Convergence Properties of Algorithms for Nonlinear Optimization
- An active set truncated Newton method for large-scale bound constrained optimization
- scientific article; zbMATH DE number 3873096 (Why is no real title available?)
- An augmented Lagrangian affine scaling method for nonlinear programming
- scientific article; zbMATH DE number 3926646 (Why is no real title available?)
- The performance of NLPNET, a large-scale nonlinear network optimizer
- scientific article; zbMATH DE number 4012327 (Why is no real title available?)
- The application of gradient-only optimization methods for problems discretized using non-constant methods
- First-order sequential convex programming using approximate diagonal QP subproblems
- scientific article; zbMATH DE number 733518 (Why is no real title available?)
- scientific article; zbMATH DE number 741102 (Why is no real title available?)
- scientific article; zbMATH DE number 741108 (Why is no real title available?)
- Improved modeling by coupling imperfect models
- scientific article; zbMATH DE number 1069181 (Why is no real title available?)
- scientific article; zbMATH DE number 1985268 (Why is no real title available?)
- scientific article; zbMATH DE number 2068030 (Why is no real title available?)
- scientific article; zbMATH DE number 1488893 (Why is no real title available?)
- scientific article; zbMATH DE number 1552015 (Why is no real title available?)
- A review on subspace methods for nonlinear optimization
- Study of a primal-dual algorithm for equality constrained minimization
- scientific article; zbMATH DE number 778135 (Why is no real title available?)
- A subspace modified PRP method for large-scale nonlinear box-constrained optimization
- On Möbius orthogonality for interval maps of zero entropy and orientation-preserving circle homeomorphisms
- Safeguarded augmented Lagrangian methods in Banach spaces
- Convergence analysis of a block improvement method for polynomial optimization over unit spheres.
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues
- Numerically efficient and robust Interior-point algorithm for finite strain rate-independent crystal plasticity
- Demanded scale for modern numerical optimisation
- YAM2: yet another library for the M₂ variables using sequential quadratic programming
- Subspace methods for nonlinear optimization
- A primal-dual interior point trust region method for second-order stationary points of Riemannian inequality-constrained optimization problems
- Large sparse numerical optimization
- Subspace methods for large scale nonlinear equations and nonlinear least squares
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- Real-time motion planning for multibody systems
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
Describes a project that uses
Uses Software
This page was built for publication: Numerical methods for large-scale nonlinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3430648)
