Partially finite convex programming. II: Explicit lattice models
From MaRDI portal
(Redirected from Publication:1198329)
Recommendations
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Finite perturbation of convex programs
- scientific article; zbMATH DE number 4041660
- scientific article; zbMATH DE number 970337
- scientific article; zbMATH DE number 3910159
- Finite dimensional convexity and optimization
- scientific article; zbMATH DE number 5165610
- The Lagrange multiplier method in the finite convex programming problem
- A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem
- Linear systems and optimization over lattices
Cites work
- A Dual Approach to Multidimensional L_p Spectral Estimation Problems
- A Lagrange multiplier theorem and a sandwich theorem for convex relations.
- A Partitioning Problem with Applications in Regional Design
- A simple constraint qualification in infinite dimensional programming
- Automatic Continuity and Openness of Convex Relations
- Constrained \(L_ p\) approximation
- Constrained interpolation and smoothing
- Convex Analysis
- Duality and well-posedness in convex interpolation∗)
- Duality Relationships for Entropy-Like Minimization Problems
- scientific article; zbMATH DE number 3850846 (Why is no real title available?)
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 3703310 (Why is no real title available?)
- scientific article; zbMATH DE number 3464348 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 3246461 (Why is no real title available?)
- scientific article; zbMATH DE number 3314644 (Why is no real title available?)
- scientific article; zbMATH DE number 3336209 (Why is no real title available?)
- Integrals which are convex functionals
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- Note—Solving the Generalized Market Area Problem
- On 'best' interpolation
- Optimization and nonsmooth analysis
- Semi-infinite transportation problems
- Some duality relationships for the generalized Neyman-Pearson problem
- Sur l'interpolation
- The Generalized Market Area Problem
Cited in
(29)- 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
- On Lagrange duality theory for dynamics vaccination games
- Higher-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization with nonsolid ordering cones
- 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
- On location-allocation problems for dimensional facilities
- Existence and characterization of conditional density projections
- On optimality conditions for quasi-relative efficient solutions in set-valued optimization
- A note on cores and quasi relative interiors in partially finite convex programming
- scientific article; zbMATH DE number 3965817 (Why is no real title available?)
- Duality and well-posedness in convex interpolation∗)
- Quadratic model updating with gyroscopic structure from partial eigendata
- A concept of inner prederivative for set-valued mappings and its applications
- A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices
- TheM2Model for Dose Simulation in Radiation Therapy
- A numerical approach for a system of transport equations in the field of radiotherapy
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- Robust inference for moment condition models without rational expectations
- The geometry of optimal partitions in location problems
- On duality theory in vector spaces without topology via algebraic core
- A nonmonotone active-set semismooth Newton method for matrix approximation with group regularization
- On constraint qualifications in nonsmooth optimization.
- No-arbitrage interpolation of the option price function and its reformulation
- An inexact SQP Newton method for convex SC\(^{1}\) minimization problems
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
This page was built for publication: Partially finite convex programming. II: Explicit lattice models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198329)