skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Thursday, October 10 until 2:00 AM ET on Friday, October 11 due to maintenance. We apologize for the inconvenience.


Search for: All records

Creators/Authors contains: "Viola, Marco"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract

    For polyhedral constrained optimization problems and a feasible point$$\textbf{x}$$x, it is shown that the projection of the negative gradient on the tangent cone, denoted$$\nabla _\varOmega f(\textbf{x})$$Ωf(x), has an orthogonal decomposition of the form$$\varvec{\beta }(\textbf{x}) + \varvec{\varphi }(\textbf{x})$$β(x)+φ(x). At a stationary point,$$\nabla _\varOmega f(\textbf{x}) = \textbf{0}$$Ωf(x)=0so$$\Vert \nabla _\varOmega f(\textbf{x})\Vert $$Ωf(x)reflects the distance to a stationary point. Away from a stationary point,$$\Vert \varvec{\beta }(\textbf{x})\Vert $$β(x)and$$\Vert \varvec{\varphi }(\textbf{x})\Vert $$φ(x)measure different aspects of optimality since$$\varvec{\beta }(\textbf{x})$$β(x)only vanishes when the KKT multipliers at$$\textbf{x}$$xhave the correct sign, while$$\varvec{\varphi }(\textbf{x})$$φ(x)only vanishes when$$\textbf{x}$$xis a stationary point in the active manifold. As an application of the theory, an active set algorithm is developed for convex quadratic programs which adapts the flow of the algorithm based on a comparison between$$\Vert \varvec{\beta }(\textbf{x})\Vert $$β(x)and$$\Vert \varvec{\varphi }(\textbf{x})\Vert $$φ(x).

     
    more » « less