Partially finite convex programming. II: Explicit lattice models

DOI10.1007/BF01581073zbMath0778.90050WikidataQ56935956 ScholiaQ56935956MaRDI QIDQ1198329

Jonathan M. Borwein, Adrian S. Lewis

Publication date: 16 January 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

interpolation; spectral estimation; constrained approximation; \(L^ 1\) approximation

Mathematics Subject Classification ID

90C25: Convex programming

90C48: Programming in abstract spaces

90C34: Semi-infinite programming

Related Items

Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior, On constraint qualifications in nonsmooth optimization., No-arbitrage interpolation of the option price function and its reformulation, Characterizing optimality in mathematical programming models, Generalizations of Slater's constraint qualification for infinite convex programs, Constrained best approximation in Hilbert space. II, On the convergence of von Neumann's alternating projection algorithm for two sets, Facial reduction in partially finite convex programming, Duality and well-posedness in convex interpolation^∗)

Cites Work

• Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
• Constrained \(L_ p\) approximation
• Constrained interpolation and smoothing
• On 'best' interpolation
• Integrals which are convex functionals
• Some duality relationships for the generalized Neyman-Pearson problem
• Sur l'interpolation
• A simple constraint qualification in infinite dimensional programming
• Duality and well-posedness in convex interpolation^∗)
• A Dual Approach to Multidimensional $L_p$ Spectral Estimation Problems
• A Lagrange multiplier theorem and a sandwich theorem for convex relations.
• Note—Solving the Generalized Market Area Problem
• Duality Relationships for Entropy-Like Minimization Problems
• The Generalized Market Area Problem
• Automatic Continuity and Openness of Convex Relations
• Convex Analysis
• A Partitioning Problem with Applications in Regional Design
• Semi-infinite transportation problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item