On piecewise quadratic Newton and trust region problems
From MaRDI portal
Publication:1356055
DOI10.1007/BF02614393zbMath0872.90088MaRDI QIDQ1356055
Publication date: 15 October 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
nonsmooth optimizationNewton's methodpiecewise quadratic functionglobal minimizertrust region problem
Related Items (6)
The convergence of subspace trust region methods ⋮ Multistage quadratic stochastic programming ⋮ A new trust region method with adaptive radius ⋮ A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications ⋮ Theoretical characteristics and numerical methods for a class of special piecewise quadratic optimization ⋮ On a primal-dual Newton proximal method for convex quadratic programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Least-norm linear programming solution as an unconstrained minimization problem
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
- On affine scaling algorithms for nonconvex quadratic programming
- Nondifferentiable optimization via smooth approximation: General analytical approach
- Some simplified NP-complete graph problems
- A trust region algorithm for minimization of locally Lipschitzian functions
- A class of smoothing functions for nonlinear and mixed complementarity problems
- A trust-region strategy for minimization on arbitrary domains
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- A nonsmooth version of Newton's method
- Nonsmooth Equations: Motivation and Algorithms
- Computing a Trust Region Step
- Optimization and nonsmooth analysis
- Computing Optimal Locally Constrained Steps
- Newton’s Method with a Model Trust Region Modification
- Proximal Subgradients, Marginal Values, and Augmented Lagrangians in Nonconvex Optimization
- Minimization of Locally Lipschitzian Functions
- Monotone Operators and the Proximal Point Algorithm
- Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
This page was built for publication: On piecewise quadratic Newton and trust region problems
