Open AccessBook
Convexity and Optimization in Finite Dimensions I
Josef Stoer,Christoph Witzgall +1 more
- 01 Jul 1970
915
About: The article was published on 01 Jul 1970. and is currently open access. The article focuses on the topics: Convexity.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Normal and sinkless Petri nets
TL;DR: This work gives the first comprehensive complexity analysis of a class of potentially unbounded Petri nets defined in terms of their behavior, and argues that although neither normal nor sinkless Petrinets are strictly more powerful than persistentPetri nets, they nonetheless are both capable of modeling a more interesting class of problems.
39
Variational Analysis Perspective on Linear Convergence of Some First Order Methods for Nonsmooth Convex Optimization Problems
TL;DR: It is proved that the linear convergence is ensured when the nonsmooth part of the objective function is the group LASSO regularizer, and the modulus for the calmness/metric subregularity is computable.
39
•Posted Content
A simplicial algorithm for the nonlinear stationary point problem on an unbounded polyhedron
TL;DR: A path-following algorithm is proposed for finding a solution to the nonlinear stationary point problem on an unbounded, convex, and pointed polyhedron.
39
Completeness results for conflict-free vector replacement systems
R. Rodney Howell,Louis E. Rosier +1 more
TL;DR: This paper gives an NP algorithm for deciding reachability, thus giving the first primitive recursive algorithm for this problem, and shows that the containment and equivalence problems for VRSs are NP-complete.
39
Applications of polyhedral computations to the analysis and verification of hardware and software systems
TL;DR: In this paper, the authors survey the range of applications of polyhedral computations in static analysis and give an overview of the different classes of polyhedra that may be adopted, and outline the main polyhedral operations required by automatic analyzers and verifiers.
38
Related Papers (5)
David G. Luenberger
- 01 Jan 1968
Alexander Schrijver
- 01 Dec 1986
George B. Dantzig
- 01 Jan 1963
[...]
Dale E. Varberg
- 01 Jan 1973