Results 31 to 40 of about 1,281,767 (368)

The extensive 1-median problem with radius on networks [PDF]

open access: yesOpuscula Mathematica, 2023
The median location problem concerns finding locations of one or several new facilities that minimize the overall weighted distances from the existing to the new facilities.
Tran Hoai Ngoc Nhan   +2 more
doaj   +1 more source

Non-Linear Inner Structure of Topological Vector Spaces

open access: yesMathematics, 2021
Inner structure appeared in the literature of topological vector spaces as a tool to characterize the extremal structure of convex sets. For instance, in recent years, inner structure has been used to provide a solution to The Faceless Problem and to ...
Francisco Javier García-Pacheco   +3 more
doaj   +1 more source

The Power of Convex Relaxation: Near-Optimal Matrix Completion [PDF]

open access: yesIEEE Transactions on Information Theory, 2009
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a great number of applications, including the famous Netflix Prize and other ...
E. Candès, T. Tao
semanticscholar   +1 more source

Hermite-Hadamard type inequalities in the setting of k-fractional calculus theory with applications

open access: yesAIMS Mathematics, 2020
The main objective of this paper is to derive some new k-fractional refinements of HermiteHadamard like inequalities. We also discuss some new special cases of the main results.
Bandar Bin-Mohsin   +3 more
doaj   +1 more source

A Rewriting System for Convex Optimization Problems [PDF]

open access: yesJournal of Control and Decision, 2017
We describe a modular rewriting system for translating optimization problems written in a domain-specific language to forms compatible with low-level solver interfaces.
Akshay Agrawal   +3 more
semanticscholar   +1 more source

Projected Stochastic Gradients for Convex Constrained Problems in Hilbert Spaces

open access: yes, 2019
Convergence of a projected stochastic gradient algorithm is demonstrated for convex objective functionals with convex constraint sets in Hilbert spaces.
Geiersbach, Caroline, Pflug, Georg
core   +1 more source

Near Convexity, Metric Convexity, and Convexity

open access: yesRocky Mountain Journal of Mathematics, 2007
Many aspects of convexity in a normed space, hidden by the classical use of the obscure principle of excluded middle, are only revealed by a constructive approach. This paper studies various types of convexity, introducing several new concepts; it uses methods proposed by \textit{E.\,A.\thinspace Bishop} in Chapter~1 of ``A Constructivist Manifesto ...
openaire   +3 more sources

The Curve Shortening Flow in the Metric-Affine Plane

open access: yesMathematics, 2020
We investigated, for the first time, the curve shortening flow in the metric-affine plane and prove that under simple geometric condition (when the curvature of initial curve dominates the torsion term) it shrinks a closed convex curve to a “round point”
Vladimir Rovenski
doaj   +1 more source

On a local version of Jack’s lemma

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019
The purpose of this paper is to provide a result which concerns with the boundary behavior of analytic functions. It may be a local version of the well known Jack’s lemma when we change the function normalization at the origin.
Nunokawa Mamoru, Sokół Janusz
doaj   +1 more source

Stochastic model-based minimization of weakly convex functions [PDF]

open access: yesSIAM Journal on Optimization, 2018
We consider an algorithm that successively samples and minimizes stochastic models of the objective function. We show that under weak-convexity and Lipschitz conditions, the algorithm drives the expected norm of the gradient of the Moreau envelope to ...
Damek Davis, D. Drusvyatskiy
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy