A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We stress the importance of proof-nets from Light linear logic for the design of this type system and for a result establishing that typable lambda-terms can be evaluated efficiently with optimal reduction ... In this presentation we give an overview of Dual Light Affine Logic (DLAL), a polymorphic type system for lambda calculus ensuring that typable lambda terms are executable in polynomial time. ... Any solution of the constraints system gives a valid DLAL type derivation. ...doi:10.1007/978-3-540-73228-0_2 fatcat:7axovijfpfbbxhxe5umqljqnku
Zhang, Ming Wang; Huang, Chong Chao (PRC-WUHAN; Wuhan) A primal-dual infeasible interior point algorithm for a convex quadratic programming problem with box constraints. (Chinese. ... An infeasible primal-dual interior point method is proposed for solving convex quadratic programming problems with box con- straints. ...
a projection method. ... We propose a method to impose homogeneous linear inequality constraints of the form Ax≤ 0 on neural network activations. ... Acknowledgements The authors would like to thank Thomas Möllenhoff, Erik Bylow, and Gideon Dresdner for fruitful discussions and valuable feedback on the manuscript. ...arXiv:1902.01785v4 fatcat:m7ihoqkeujbqxhu26cjdpf2mve
Optimization is carried out by using sequential linear programming with improved move limit method. ... A computer program is developed in C-programming language to design the deck slab and PSC Box-girder. ... In this project the cost optimization of pre-cast post tensioned concrete deck type box-girder bridge is carried out. ...doi:10.21275/art20175347 fatcat:2iombm4zgjekpgnqdxoattlfm4
Advances in Computer Graphics V
or informal design methods, programming languages and techniques, and software environments for programming or testing purposes. ... artifact which is designed during a Ph.D. project, which is taken as subject for research or is used as an aid or as a tool in the research, and which is described in a Ph.D. dissertation. ... In cooperation with the Architecture department, specific constraint types and solving methods were determined for the VR-DIS project in order to allow architects to experiment with constraints. ...doi:10.1007/978-3-642-61340-1_5 fatcat:sqpjkhndvffevnsecvgwas74he
There was already some precedent for this type of effort; see for example the survey paper by Monteiro , which discusses first-order methods for large-scale SDPs. ... programs with semidefinitebased finite branch-and-bound," published in Volume 43 pages 181-195. ... tree by quickly reoptimizing linear programming (LP) relaxations using the dual simplex method. ...doi:10.1007/s10589-010-9368-9 fatcat:gptxrvhr5zf27e2schkcqtatz4
The objective is to determine a mode, the amount of continuous crashing, and a start time for each activity so that all constraints are obeyed and the project duration is minimized. ... Project scheduling of this type occurs in many fields for instance, predicting the resources and duration of activities in software development projects. ... RCPSP-GPR which is linear and the most popular objective in the project scheduling problems can be used as follows: Minimize T. (17) No Overlapping Constraints The constraints for packing boxes are ...doaj:3bcdc2b9c46d4a4198d3d4dd29ec2538 fatcat:n3z77pllrbghzim746h5ta4jmq
(UKR-AOS-B; Kiev) The linearization method for limit extremal problems with constraints. (Russian. English and Ukrainian summaries) Kibernet. Sistem. ... A class of reduced-gradient projection algorithms for solving the case where the simpler polyhedral set is a box is proposed and this bound is used to show that algorithms in this class attain a linear ...
The method is a variant of a projection algorithm that is shown to be robust, even in the presence of nonconvex constraints and infeasibility. Empirical results are presented. ... T his paper develops a method for moving quickly and cheaply from an arbitrary initial point at an extreme distance from the feasible region to a point that is relatively near the feasible region of a ... Acknowledgments This research is supported by a research grant to the author from the Natural Sciences and Engineering Research Council of Canada. ...doi:10.1287/ijoc.1030.0046 fatcat:wdbj2ymovrchliqbyn2yybhhie
From the method repertoire custom made strategies can be built, with a user-friendly graphical interface. ... The algorithms implemented in GloptLab are used to reduce the search space: scaling, constraint propagation, linear relaxations, strictly convex enclosures, conic methods, and branch and bound. ... Acknowledgements I would like to thank Arnold Neumaier, for his help and support and Martin Fuchs for his creative ideas and corrections. ...doi:10.1080/10556780902917701 fatcat:imk4sacl6nbqna4uivjej4ei7a
Finally, we present a brief analysis of the obtained solutions to the stochastic linear programming problems with Boolean variables. ... This model assumes that budget constraints of the state and the investor can vary in a random manner with a specific probability distribution. ... The work was carried out within the framework of the state contract of the Sobolev Institute of Mathematics (projects no. 0314-2019-0018) and the Russian Foundation for Basic Research (projects no. 19- ...doi:10.1051/e3sconf/202126504028 fatcat:5ye6dh7ddnf4vdpsxdmsh5i3lq
INTRODUCTION Many types of capital budgeting and project programming problems can be formulated as linear or nonlinear binary integer programs (for example, see Johnson et al. 1985; Nemhauser and Ullmann ... METHOD OF PROGRAMMING REGIONAL HIGHWAY PROJECTS By Bruce N. Janson! ...
This paper deals with the computation of the interior point cutting plane algorithm of Goffin, Haurie and Vial, with a special application to the solution of convex differentiable programming problems. ... The paper focuses on the different stages of a MATLAB implementation and the overall performance of the algorithm. The test problems come from a set of convex geometric programming problems. ... The oracle generates either a constraint of type (11) and the algorithm switches to phase II; or a first constraint of type (10). ...doi:10.1016/0166-218x(94)90198-8 fatcat:47hxfzo5lngfzj3rnobm3plbhq
for monotone variational inequalities with box constraint. ... The main result is applied to the stability analysis of a nonlinear program with linear constraints. Adam B. ...
The literature abounds with many seminal works that address this problem, some focusing on continuous approaches (e.g. linear program relaxation) while others on discrete ones (e.g., min-cut). ... To this end, we propose a novel and versatile framework called ℓ_p-box ADMM, which is based on two parts. (1) The discrete constraint is equivalently replaced by the intersection of a box and a (n-1)-dimensional ... Note that the LP method solves a convex QP with simple box constraints. ...arXiv:1604.07666v3 fatcat:iwhmyekil5c4ra7opju5cbm2xq
« Previous Showing results 1 — 15 out of 114,739 results