Numerical methods for large-scale nonlinear optimization
From MaRDI portal
Publication:3430648
DOI10.1017/S0962492904000248zbMath1119.65337OpenAlexW2150116987WikidataQ58185810 ScholiaQ58185810MaRDI QIDQ3430648
Dominique Orban, Phillipe L. Toint, Nick I. M. Gould
Publication date: 23 March 2007
Published in: Acta Numerica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0962492904000248
unconstrained optimizationlinearly constrained optimizationbound-constrained optimizationlarge-scale nonlinear optimizationnon-linearly constrained problems
Related Items
Subspace methods for large scale nonlinear equations and nonlinear least squares, An active-set algorithm for norm constrained quadratic problems, Safeguarded Augmented Lagrangian Methods in Banach Spaces, On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods, An active set truncated Newton method for large-scale bound constrained optimization, An augmented Lagrangian affine scaling method for nonlinear programming, The convergence of subspace trust region methods, Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems, A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization, The application of gradient-only optimization methods for problems discretized using non-constant methods, First-order sequential convex programming using approximate diagonal QP subproblems, Real-time motion planning for multibody systems, An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization, Numerically efficient and robust Interior-point algorithm for finite strain rate-independent crystal plasticity, YAM2: yet another library for the \(M_2\) variables using sequential quadratic programming, Improved modeling by coupling imperfect models, A limited-memory trust-region method for nonlinear optimization with many equality constraints, Flattened aggregate function method for nonlinear programming with many complicated constraints, An accurate active set conjugate gradient algorithm with project search for bound constrained optimization, Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization, An active set limited memory BFGS algorithm for large-scale bound constrained optimization, Study of a primal-dual algorithm for equality constrained minimization, A primal-dual active set method and predictor-corrector mesh adaptivity for computing fracture propagation using a phase-field approach, 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, Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization, Convergence analysis of a block improvement method for polynomial optimization over unit spheres, Newton-type methods: a broader view, Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues, Two-phase-SQP method with higher-order convergence property, Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization, Numerical optimization applying trust-region reflective least squares algorithm with constraints to optimize the non-linear creep parameters of soft soil, A limited memory BFGS-type method for large-scale unconstrained optimization, Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization, Some new facts about sequential quadratic programming methods employing second derivatives, A subspace SQP method for equality constrained optimization, AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION, On a primal-dual Newton proximal method for convex quadratic programs
Uses Software
