An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
From MaRDI portal
Publication:1337633
DOI10.1007/BF02252984zbMath0820.90099MaRDI QIDQ1337633
Publication date: 14 September 1995
Published in: Computing (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90C06: Large-scale problems in mathematical programming
90C30: Nonlinear programming
Related Items
PARALLEL MULTISPLITTINGS FOR CONSTRAINED OPTIMIZATION, New constrained optimization reformulation of complementarity problems, A new technique for inconsistent QP problems in the SQP method, Solution of monotone complementarity problems with locally Lipschitzian functions, Limited memory quasi-Newton method for large-scale linearly equality-constrained minimization, A neural network for the linear complementarity problem, On the resolution of monotone complementarity problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some numerical experiments with variable-storage quasi-Newton algorithms
- On the limited memory BFGS method for large scale optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- Representations of quasi-Newton matrices and their use in limited memory methods
- A new trust region algorithm for bound constrained minimization
- On the resolution of monotone complementarity problems
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Numerical Experience with Limited-Memory Quasi-Newton and Truncated Newton Methods
- Newton-Type Minimization via the Lanczos Method
- A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
- Preconditioning of Truncated-Newton Methods
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Updating Quasi-Newton Matrices with Limited Storage
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- New Results on a Continuously Differentiable Exact Penalty Function
- On the Resolution of Linearly Constrained Convex Minimization Problems
- A special newton-type optimization method
- Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems