Related papers: How to project onto the monotone nonnegative cone …
A new exact projective penalty method is proposed for the equivalent reduction of constrained optimization problems to nonsmooth unconstrained ones. In the method, the original objective function is extended to infeasible points by summing…
Let a polyhedral convex set be given by a finite number of linear inequalities and consider the problem to project this set onto a subspace. This problem, called polyhedral projection problem, is shown to be equivalent to multiple objective…
The convergence of a new general variable metric algorithm based on compositions of averaged operators is established. Applications to monotone operator splitting are presented.
We study the metric projection onto the closed convex cone in a real Hilbert space $\mathscr{H}$ generated by a sequence $\mathcal{V} = \{v_n\}_{n=0}^\infty$. The first main result of this paper provides a sufficient condition under which…
Vector optimization problems are a generalization of multiobjective optimization in which the preference order is related to an arbitrary closed and convex cone, rather than the nonnegative octant. Due to its real life applications, it is…
By using Moreau's decomposition theorem for projecting onto cones, the problem of projecting onto a simplicial cone is reduced to finding the unique solution of a nonsmooth system of equations. It is shown that Picard's method applied to…
In this note, we provide explicit expressions for the projections onto the graph of a quadratic polynomial. The projections are obtained by examining the critical points of the associated quartic polynomial, that is, the roots of the cubic…
The metric projection onto the positive semidefinite (PSD) cone is strongly semismooth, a property that guarantees local quadratic convergence for many powerful algorithms in semidefinite programming. In this paper, we investigate whether…
Let A be a Noetherian commutative ring. Assume that projective modules of rank r over polynomial extensions of A are extended from A. Then projective modules of rank r over discrete Hodge A-algebras are also extended from A. This result…
A new equivalent reformulation of the absolute value equations associated with second-order cone (SOCAVEs) is emphasised, from which a dynamical system based on projection operator for solving SOCAVEs is constructed. Under proper…
Variable order structures model situations in which the comparison between two points depends on a point-to-cone map. In this paper, an inexact projected gradient method for solving smooth constrained vector optimization problems on…
Shape-constrained inference has wide applicability in bioassay, medicine, economics, risk assessment, and many other fields. Although there has been a large amount of work on monotone-constrained univariate curve estimation, multivariate…
Adjoint functors and projectivization in representation theory of partially ordered sets are used to generalize the algorithms of differentiation by a maximal and by a minimal point. Conceptual explanations are given for the combinatorial…
We introduce the notion of order projections using the order unit property of a positive element in an order unit space and characterize them in terms of (geometric) orthogonality. We describe order projections of the order unit space…
We exhibit a class of classical or tropical posynomial systems which can be solved by reduction to linear or convex programming problems. This relies on a notion of colorful vectors with respect to a collection of Newton polytopes. This…
Problems related to projections on closed convex cones are frequently encountered in optimization theory and related fields. To study these problems, various unifying ideas have been introduced, including asymmetric vector-valued norms and…
We study polyhedral approximations to the cone of nonnegative polynomials. We show that any constant ratio polyhedral approximation to the cone of nonnegative degree $2d$ forms in $n$ variables has to have exponentially many facets in terms…
Fix a manifold M, and let V be an infinite dimensional Lie algebra of vector fields on M. Assume that V contains a finite dimensional semisimple maximal subalgebra A, the projective or conformal subalgebra. A projective or conformal…
This paper addresses a class of (non-)convex optimization problems subject to general convex constraints, which pose significant challenges for traditional methods due to their inherent non-convexity and diversity. Conventional convex…
The method of alternating projections involves orthogonally projecting an element of a Hilbert space onto a collection of closed subspaces. It is known that the resulting sequence always converges in norm if the projections are taken…