English
Related papers

Related papers: Projection onto simplicial cones by a semi-smooth …

200 papers

This paper introduces a smoothed proximal Lagrangian method for minimizing a nonconvex smooth function over a convex domain with additional explicit convex nonlinear constraints. Two key features are 1) the proposed method is single-looped,…

Optimization and Control · Mathematics 2024-08-28 Wenqiang Pu , Kaizhao Sun , Jiawei Zhang

This article is concerned with a geometric tool given by a pair of projector operators defined by almost product structures on finite dimensional manifolds, polarized by a distribution of constant rank and also endowed with some geometric…

Mathematical Physics · Physics 2011-10-11 Paulo Pitanga , Paulo R. Rodrigues

For finite difference discretizations with linear complexity and provably convergent to weak solutions of the second boundary value problem for the Monge-Amp\`ere equation, we give the first proof of uniqueness. The boundary condition is…

Numerical Analysis · Mathematics 2025-05-28 Gerard Awanou

This paper details a novel indirect method for solving constrained optimal control problems (OCPs) directly in continuous-time function space. The KKT conditions are embedded in a non-smooth complementarity function, which enables their…

Optimization and Control · Mathematics 2026-05-11 Simon J. Jones , Dominic Liao-McPherson , Marco M. Nicotra

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…

Optimization and Control · Mathematics 2020-05-15 Marianne Akian , Xavier Allamigeon , Marin Boyet , Stéphane Gaubert

The discrete non-commutative Darboux system of equations with self-consistent sources is constructed, utilizing both the vectorial fundamental (binary Darboux) transformation and the method of additional independent variables. Then the…

Exactly Solvable and Integrable Systems · Physics 2021-02-09 Adam Doliwa , Runliang Lin , Zhe Wang

We prove global convergence of classical projection algorithms for feasibility problems involving union convex sets, which refer to sets expressible as the union of a finite number of closed convex sets. We present a unified strategy for…

Optimization and Control · Mathematics 2023-07-18 Jan Harold Alcantara , Ching-pei Lee

This paper proposes and justifies two globally convergent Newton-type methods to solve unconstrained and constrained problems of nonsmooth optimization by using tools of variational analysis and generalized differentiation. Both methods are…

Optimization and Control · Mathematics 2023-04-27 Pham Duy Khanh , Boris Mordukhovich , Vo Thanh Phat , Dat Ba Tran

We establish long time soliton asymptotics for the nonlinear system of Maxwell equations coupled to a charged particle. The coupled system has a six dimensional manifold of soliton solutions. We show that in the long time approximation, any…

Mathematical Physics · Physics 2010-12-03 Valery Imaykin , Alexander Komech , Herbert Spohn

The textbook Newton's iteration is practically inapplicable on solutions of nonlinear systems with singular Jacobians. By a simple modification, a novel extension of Newton's iteration regains its local quadratic convergence toward…

Numerical Analysis · Mathematics 2024-04-22 Zhonggang Zeng

In this short note, we reduce lower bounds on monotone projections of polynomials to lower bounds on extended formulations of polytopes. Applying our reduction to the seminal extended formulation lower bounds of Fiorini, Massar, Pokutta,…

Computational Complexity · Computer Science 2018-06-11 Joshua A. Grochow

We propose a new subgradient method for the minimization of nonsmooth convex functions over a convex set. To speed up computations we use adaptive approximate projections only requiring to move within a certain distance of the exact…

Optimization and Control · Mathematics 2015-03-19 Dirk A. Lorenz , Marc E. Pfetsch , Andreas M. Tillmann

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…

Optimization and Control · Mathematics 2023-12-05 Vladimir Norkin

The ground state energy of a many-electron system can be approximated by an variational approach in which the total energy of the system is minimized with respect to one and two-body reduced density matrices (RDM) instead of many-electron…

Optimization and Control · Mathematics 2017-09-01 Yongfeng Li , Zaiwen Wen , Chao Yang , Yaxiang Yuan

In the first part of this paper, we generalize the results of the author \cite{Liu,Liu2} from the random flow case to the random semiflow case, i.e. we obtain Conley decomposition theorem for infinite dimensional random dynamical systems.…

Dynamical Systems · Mathematics 2009-11-13 Zhenxin Liu

We construct projectors in the ring of correspondences of a complex uniruled 3-fold $X$ which lift the Kuenneth components of the diagonal in singular cohomology and have other properties which were conjectured by J. Murre. Such Murre…

alg-geom · Mathematics 2014-10-24 Pedro Luis del Angel , Stefan Müller-Stach

Recently, the proximal Newton-type method and its variants have been generalized to solve composite optimization problems over the Stiefel manifold whose objective function is the summation of a smooth function and a nonsmooth function. In…

Optimization and Control · Mathematics 2025-02-11 Qinsi Wang , Wei Hong Yang

Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…

Differential Geometry · Mathematics 2024-07-18 Gustave Bainier , Benoit Marx , Jean-Christophe Ponsart

In the present paper, in order to fnd a singularity of a vector field defined on Riemannian manifolds, we present a new globalization strategy of Newton method and establish its global convergence with superlinear rate. In particular, this…

Fourier-Motzkin elimination is a projection algorithm for solving finite linear programs. We extend Fourier-Motzkin elimination to semi-infinite linear programs which are linear programs with finitely many variables and infinitely many…

Optimization and Control · Mathematics 2014-04-30 Amitabh Basu , Kipp Martin , Chris Ryan