Solving minimum norm problems using penalty functions and the gradient method

DOI10.1016/0005-1098(94)00072-QzbMath0819.93029OpenAlexW2090623032MaRDI QIDQ1805425

Walter E. Lillo, Stanislaw H. Żak, Stefen Hui

Publication date: 11 May 1995

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0005-1098(94)00072-q

zbMATH Keywords

unconstrained optimizationcontrollabilitynonlinear programminggradient methodvariable structure systemspenalty functionminimum norm

Mathematics Subject Classification ID

Controllability (93B05) Discrete-time control/observation systems (93C55) Methods of reduced gradient type (90C52)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The stability and control of discrete processes
• Analog solution of algebraic and transcendental equations by the gradient method
• Fast projection methods for minimal design problems in linear system theory
• Sliding modes in control and optimization. Transl. from the Russian
• Using sliding modes in static optimization and nonlinear programming
• Method of 'penalty' functions and the foundations of Pyne's method
• The gradient method of solving convex programmig problems on electronic analog computers
• Iterative algorithm for the minimum fuel and minimum amplitude problems for linear discrete systems
• Necessary and sufficient conditions for a penalty method to be exact
• Functional analysis and the optimal control of linear discrete systems

This page was built for publication: Solving minimum norm problems using penalty functions and the gradient method