A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization
DOI10.1007/S40305-013-0029-4zbMATH Open1329.90137OpenAlexW2111324354MaRDI QIDQ743777FDOQ743777
Authors: Geovani Nunes Grapiglia, Jinyun Yuan, Yaxiang Yuan 
Publication date: 30 September 2014
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-013-0029-4
Recommendations
- A subspace version of the Wang-Yuan augmented Lagrangian-trust region method for equality constrained optimization
- On a subproblem of trust region algorithms for constrained optimization
- A new trust-region algorithm for equality constrained optimization
- A trust region algorithm for equality constrained optimization
- A trust region algorithm for equality constrained optimization
- scientific article; zbMATH DE number 1150500
- scientific article; zbMATH DE number 1399524
- A trust-region algorithm for equality-constrained optimization via a reduced dimension approach.
- A subspace SQP method for equality constrained optimization
- Subspace trust-region algorithm with conic model for unconstrained optimization
Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of quasi-Newton type (90C53)
Cites Work
- CUTEr and SifDec
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Optimization theory and methods. Nonlinear programming
- A trust region algorithm for equality constrained optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a subproblem of trust region algorithms for constrained optimization
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- Title not available (Why is that?)
- Reduced-Hessian quasi-Newton methods for unconstrained optimization
- Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization
- Implementing and modifying Broyden class updates for large scale optimization
- A trust region subspace method for large-scale unconstrained optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- On subspace properties of the quadratically constrained quadratic program
- Two-phase-SQP method with higher-order convergence property
- A local MM subspace method for solving constrained variational problems in image recovery
- \(Q\)-fully quadratic modeling and its application in a random subspace derivative-free method
- Recent advances in trust region algorithms
- A subspace SQP method for equality constrained optimization
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- A limited-memory trust-region method for nonlinear optimization with many equality constraints
- Subspace choices for the Celis-Dennis-Tapia problem
- Numerical experience with a polyhedral-norm CDT trust-region algorithm
- A subspace version of the Wang-Yuan augmented Lagrangian-trust region method for equality constrained optimization
Uses Software
This page was built for publication: A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743777)
