A class of programming problems whose objective function contains a norm

DOI10.1016/0021-9045(78)90091-6MaRDI QIDQ1254496zbMATH OpenOpenAlexFDO

Authors G. A. Watson

Publication date 1978

Published in Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0021-9045(78)90091-6

zbMATH Keywords

Constrained Best Approximation ProblemsOptimization AlgorithmsProgramming Problems

Mathematics Subject Classification ID

Nonlinear programming (90C30) Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation with constraints (41A29)

Cites work

• scientific article; zbMATH DE number 3257775 (Why is no real title available?)
• scientific article; zbMATH DE number 3258269 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• A class of nondifferentiable mathematical programming problems
• A programming problem with an L_p norm in the objective function
• Algorithms for solving the dual problem for Av = b with varying norms
• Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
• On an algorithm for best approximate solutions to Av=b in normed linear spaces
• Solutions of overdetermined linear equations which minimize error in an abstract norm
• Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints

Cited in

(12)

• Generalized concavity and duality with a square root term
• First and second order conditions for a class of nondifferentiable optimization problems
• Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems
• Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
• Proper efficiency conditions and duality models for constrained multiobjective optimal control probelms containing arbitrary norms
• Optimality conditions and duality models for a class of nonsmooth constrained fractional optimal control problems
• On strong pseudoinvexity in a programming problem containing \(L_p\) norm in the objective function.
• Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized (,,)-V-invex functions and arbitrary norms
• Best approximation with prescribed norm
• Minmax programming problems with \(L_ p\)-norms via nonsmooth \(V\)-invexity.
• Efficiency Criteria and Duality Models for Multiobjective Fractional Programming Problems Containing Locall'y Subdifferentiable and ρ-Convex Functions
• OPTIMALITY CONDITIONS AND DUALITY MODELS FOR A CLASS OF NONSMOOTH CONTINUOUS-TIME GENERALIZED FRACTIONAL PROGRAMMING PROBLEMS

This page was built for publication: A class of programming problems whose objective function contains a norm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1254496)