Extremal types for certain \(L^ p \)minimization problems and associated large scale nonlinear programs
DOI10.1007/BF01460129zbMath0515.49022MaRDI QIDQ1051891
Publication date: 1983
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01460129
convergence rate; Newton method; constrained minimization; bang-bang solutions; classification of extremals; conditional and projected gradient methods; large scale structured nonlinear programs
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
49M15: Newton-type methods
49M37: Numerical methods based on nonlinear programming
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
90C52: Methods of reduced gradient type
52Bxx: Polytopes and polyhedra
Related Items
Cites Work
- Unnamed Item
- Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
- Convergence Rates for Conditional Gradient Sequences Generated by Implicit Step Length Rules
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
- Rates of Convergence for Conditional Gradient Algorithms Near Singular and Nonsingular Extremals
- On The Nonlinear Control Problem with Control Appearing Linearly
- A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
- Convex Analysis