Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 83 (1994), S. 333-354 
    ISSN: 1573-2878
    Keywords: Minimum norm solutions ; duality relations ; computational methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper describes, analyzes, and tests methods for solvingl p -minimum norm problems of the form $$\min \left\| x \right\|_p^p /p,s.t.Ax = b,$$ where 1〈p〈∞ andA x=b is a consistent system of linear equations. The paper presents a primal Newton method for problems withp〉2 and a dual Newton method that is suitable when 1〈p〈2. Primaldual methods are also introduced. Numerical experiments illustrate the usefulness of the proposed methods.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 76 (1993), S. 183-193 
    ISSN: 1573-2878
    Keywords: Minimum norm solutions ; duality ; relations between primal and dual solutions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This note investigates the problem $$\min x_p^p /p,s.t.Ax \geqslant b,$$ where 1〈p〈∞. It is proved that the dual of this problem has the form $$\max b^T y - A^T y_q^q /q,s.t.y \geqslant 0,$$ whereq=p/(p−1). The main contribution is an explicit rule for retrieving a primal solution from a dual one. If an inequality is replaced by an equality, then the corresponding dual variable is not restricted to stay nonnegative. A similar modification exists for interval constraints. Partially regularized problems are also discussed. Finally, we extend an observation of Luenberger, showing that the dual of $$\min x_p ,s.t.Ax \geqslant b,$$ is $$\max b^T y,s.t.y \geqslant 0,A^T y_q \leqslant 1,$$ and sharpening the relation between a primal solution and a dual solution.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...