• https://doi.org/10.1007/978-1-4757-3409-6_3Copy DOI Icon

Analysis and Problem Characterization

  • Jan 1, 2001
  • Ba-Ngu Vo +2 more
Show More
  • Abstract
  • Literature Map
  • Similar Papers
Abstract

The previous chapter addresses the envelope constrained (EC) filtering problem from the general view point of a convex programming problem by examining properties of the cost functional and the feasible region. This chapter examines the primal-dual nature of the EC filtering problem. In particular, generalized versions of the Kuhn-Tucker Theorem and Duality Theorem (Appendix B.5) are used to convert the quadratic programming problem in Hilbert space into its dual in the space of regular Borel measures. Furthermore, by exploiting the mutual singularity of the dual variables, we can rewrite the dual problem as an unconstrained one. This form, however, does not retain the desirable smooth feature of the original dual. The relationship between the primal and dual solutions suggests an interesting interpretation of the structure of optimal EC filters. For the case in which the decision variable is finite dimensional, we have a semi-infinite programming (SIP) problem, i.e. finite number of degrees of freedom but infinite number of constraints. In this case, Carathéodor’s Dimensionality Theorem (Appendix B.3) can be applied to convert the convex but infinite dimensional dual problem into a non-convex finite dimensional problem.KeywordsDual ProblemPrimal ProblemDuality TheoremMatched FilterSupport PointThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Similar Papers
  • Research Article
  • Citations45

Interval-parameter Two-stage Stochastic Semi-infinite Programming: Application to Water Resources Management under Uncertainty

  • Aug 05, 2008
  • Water Resources Management
  • P Guo +3
  • Book Chapter

Analog Envelope Constrained Filters for Channel Equalization

  • Jan 01, 1996
  • A Cantoni +3
  • Research Article
  • Citations19

Continuous-time envelope constrained filter design via orthonormal filters

  • Jan 01, 1995
  • IEE Proceedings - Vision, Image, and Signal Processing
  • B Vo
  • Book Chapter

Optimality Conditions for Minimax Semi-Infinite Fractional Programming Involving Generalized Convexity

  • Jan 01, 2013
  • Xiaoyan Gao
  • PDF
  • Research Article
  • Citations1

Optimal Borel measure controls for the two-dimensional stationary Boussinesq system

  • Jan 01, 2022
  • ESAIM: Control, Optimisation and Calculus of Variations
  • Gilbert Peralta
  • Research Article
  • Citations15

Duality theorems and saddle point optimality conditions in fuzzy nonlinear programming problems based on different solution concepts

  • Jan 17, 2007
  • Fuzzy Sets and Systems
  • Hsien-Chung Wu
  • Research Article
  • Citations13

Duality theory for bounds on integrals with applications to stop-loss premiums

  • Jul 01, 1983
  • Scandinavian Actuarial Journal
  • F De Vylder
  • Research Article
  • Citations59

Optimality conditions for non-smooth semi-infinite programming

  • Jul 01, 2010
  • Optimization
  • N Kanzi +1
  • Research Article
  • Citations29

A logarithmic barrier cutting plane method for convex programming

  • Mar 01, 1995
  • Annals of Operations Research
  • D Den Hertog +3
  • Research Article
  • Citations7

A duality theorem for linear congruences

  • Jan 01, 1984
  • Discrete Applied Mathematics
  • H.P Williams
  • Book Chapter

3 - Further Topics in Linear Programming

  • Jan 01, 1995
  • Elementary Linear Programming with Applications
  • Bernard Kolman +1
  • Book Chapter

Branch-and-Bound Reduction Type Method for Semi-Infinite Programming

  • Jan 01, 2011
  • Ana I Pereira +1
  • Research Article
  • Citations16

Saddle Points Theory of Two Classes of Augmented Lagrangians and Its Applications to Generalized Semi-infinite Programming

  • Oct 25, 2008
  • Applied Mathematics and Optimization
  • Changyu Wang +2
  • Research Article
  • Citations11

Duality for nondifferentiable minimax programming in complex spaces

  • Oct 25, 2008
  • Nonlinear Analysis: Theory, Methods & Applications
  • Hang-Chin Lai +1
  • Book Chapter

Duality Principle and Dual Simplex Method

  • Jan 01, 2023
  • Ping-Qi Pan
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.