Partially finite convex programming. II: Explicit lattice models

DOI10.1007/BF01581073zbMath0778.90050OpenAlexW2115410170WikidataQ56935956 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)

Full work available at URL: https://doi.org/10.1007/bf01581073

zbMATH Keywords

interpolationspectral estimationconstrained approximation\(L^ 1\) approximation

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48) Semi-infinite programming (90C34)

Related Items (25)

Facial reduction in partially finite convex programming ⋮ On Lagrange duality theory for dynamics vaccination games ⋮ On optimality conditions for quasi-relative efficient solutions in set-valued optimization ⋮ A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices ⋮ Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions ⋮ TheM₂Model for Dose Simulation in Radiation Therapy ⋮ Characterizing optimality in mathematical programming models ⋮ Higher-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization with nonsolid ordering cones ⋮ Quadratic model updating with gyroscopic structure from partial eigendata ⋮ A Note on Cores and Quasi Relative Interiors in Partially Finite Convex Programming ⋮ An approximation of the \(M_2\) closure: application to radiotherapy dose simulation ⋮ A moment closure based on a projection on the boundary of the realizability domain: 1D case ⋮ Duality and well-posedness in convex interpolation^∗) ⋮ A concept of inner prederivative for set-valued mappings and its applications ⋮ The geometry of optimal partitions in location problems ⋮ A Numerical Approach for a System of Transport Equations in the Field of Radiotherapy ⋮ Generalizations of Slater's constraint qualification for infinite convex programs ⋮ Constrained best approximation in Hilbert space. II ⋮ On constraint qualifications in nonsmooth optimization. ⋮ No-arbitrage interpolation of the option price function and its reformulation ⋮ Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior ⋮ An inexact SQP Newton method for convex SC\(^{1}\) minimization problems ⋮ EXISTENCE AND CHARACTERIZATION OF CONDITIONAL DENSITY PROJECTIONS ⋮ On location-allocation problems for dimensional facilities ⋮ On the convergence of von Neumann's alternating projection algorithm for two sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Optimization and nonsmooth analysis
• 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

This page was built for publication: Partially finite convex programming. II: Explicit lattice models