全文获取类型
收费全文 | 2315篇 |
免费 | 35篇 |
国内免费 | 55篇 |
专业分类
化学 | 22篇 |
力学 | 103篇 |
综合类 | 3篇 |
数学 | 2085篇 |
物理学 | 192篇 |
出版年
2023年 | 20篇 |
2022年 | 20篇 |
2021年 | 21篇 |
2020年 | 21篇 |
2019年 | 27篇 |
2018年 | 40篇 |
2017年 | 42篇 |
2016年 | 41篇 |
2015年 | 26篇 |
2014年 | 84篇 |
2013年 | 133篇 |
2012年 | 185篇 |
2011年 | 101篇 |
2010年 | 101篇 |
2009年 | 152篇 |
2008年 | 183篇 |
2007年 | 135篇 |
2006年 | 108篇 |
2005年 | 88篇 |
2004年 | 62篇 |
2003年 | 45篇 |
2002年 | 52篇 |
2001年 | 51篇 |
2000年 | 38篇 |
1999年 | 47篇 |
1998年 | 43篇 |
1997年 | 51篇 |
1996年 | 45篇 |
1995年 | 42篇 |
1994年 | 31篇 |
1993年 | 21篇 |
1992年 | 22篇 |
1991年 | 15篇 |
1990年 | 10篇 |
1989年 | 9篇 |
1988年 | 8篇 |
1987年 | 4篇 |
1986年 | 21篇 |
1985年 | 32篇 |
1984年 | 29篇 |
1983年 | 27篇 |
1982年 | 33篇 |
1981年 | 20篇 |
1980年 | 39篇 |
1979年 | 24篇 |
1978年 | 38篇 |
1977年 | 8篇 |
1976年 | 3篇 |
1972年 | 2篇 |
1969年 | 2篇 |
排序方式: 共有2405条查询结果,搜索用时 15 毫秒
41.
J. -B. Hiriart-Urruty 《Journal of Optimization Theory and Applications》1986,48(1):127-140
Given a convex functionf:
p
×
q
(–, +], the marginal function is defined on
p
by (x)=inf{f(x, y)|y
q
}. Our purpose in this paper is to express the approximate first-order and second-order directional derivatives of atx
0 in terms of those off at (x
0,y
0), wherey
0 is any element for which (x
0)=f(x
0,y
0).The author is indebted to one referee for pointing out an inaccuracy in an earlier version of Theorem 4.1. 相似文献
42.
《Journal of Pure and Applied Algebra》2022,226(12):107144
We consider parametric optimization problems from an algebraic viewpoint. The idea is to find all of the critical points of an objective function thereby determining a global optimum. For generic parameters (data) in the objective function the number of critical points remains constant. This number is known as the algebraic degree of an optimization problem. In this article, we go further by considering the inverse problem of finding parameters of the objective function so it gives rise to critical points exhibiting a special structure. For example if the critical point is in the singular locus, has some symmetry, or satisfies some other algebraic property. Our main result is a theorem describing such parameters. 相似文献
43.
《Operations Research Letters》2022,50(4):399-406
We consider the problem faced by an online service platform that matches suppliers with consumers. Unlike traditional matching models, which treat them as passive participants, we allow both sides of the market to exercise their choices. To model this setting, we introduce a two-sided assortment optimization model wherein each participant's choice is modeled using a multinomial logit choice function, and the platform's objective is to maximize its expected revenue. We first show that the problem is NP-hard even when the number of suppliers is limited to two and provide a mixed-integer linear programming formulation. Next, we discuss two simple greedy heuristics and argue that these can lead to arbitrarily bad solutions. We then develop relaxations that provide upper and lower bounds and investigate the tightness of these relaxations by obtaining parametric approximation guarantees. Finally, we present numerical results on synthetic data demonstrating the practical utility of these relaxations. 相似文献
44.
45.
K. C. Kiwiel 《Applied Mathematics and Optimization》1995,32(3):235-254
Letf: n (–, ] be a convex polyhedral function. We show that if any standard active set method for quadratic programming (QP) findsx(t)= arg min
x
¦x¦2/2+t
f(x) for somet> 0, then its final working set defines a simple equality QP subproblem, whose Lagrange multiplier can be used both for testing ift is large enough forx(t) to coincide with the normal minimizer off, and for increasingt otherwise. The QP subproblem may easily be solved via the matrix factorizations used for findingx(t). This opens up the way for efficient implementations. We also give finite methods for computing the whole trajectory {x(t)}
t
0, minimizingf over an ellipsoid, and choosing penalty parameters inL
1QP methods for strictly convex QP.This research was supported by the State Committee for Scientific Research under Grant 8S50502206. 相似文献
46.
In this paper, we introduce a potential reduction method for harmonically convex programming. We show that, if the objective function and them constraint functions are allk-harmonically convex in the feasible set, then the number of iterations needed to find an -optimal solution is bounded by a polynomial inm, k, and log(1/). The method requires either the optimal objective value of the problem or an upper bound of the harmonic constantk as a working parameter. Moreover, we discuss the relation between the harmonic convexity condition used in this paper and some other convexity and smoothness conditions used in the literature.The authors like to thank Dr. Hans Nieuwenhuis for carefully reading this paper and the anonymous referees for the worthy suggestions. 相似文献
47.
Luis A. Caffarelli Cristian E. Gutié rrez 《Transactions of the American Mathematical Society》1996,348(3):1075-1092
In this paper we consider a family of convex sets in , , , , satisfying certain axioms of affine invariance, and a Borel measure satisfying a doubling condition with respect to the family The axioms are modelled on the properties of the solutions of the real Monge-Ampère equation. The purpose of the paper is to show a variant of the Calderón-Zygmund decomposition in terms of the members of This is achieved by showing first a Besicovitch-type covering lemma for the family and then using the doubling property of the measure The decomposition is motivated by the study of the properties of the linearized Monge-Ampère equation. We show certain applications to maximal functions, and we prove a John and Nirenberg-type inequality for functions with bounded mean oscillation with respect to
48.
O. Naselli 《Journal of Optimization Theory and Applications》1996,91(1):81-90
In this paper, we present a class of functions:f:X such that inf
xX
f(x)=
, whereX is a nonempty, finitely compact and convex set in a vector space andB
x
={xX: y aff(X){x:[x, y]X={x}. Our main tool is a recent minimax theorem by Ricceri (Ref. 1). 相似文献
49.
Onk-StrictlyConvexandk-VerySmoothBanachSpacesZhangZihou(张子厚)(HuainanTelecisionUniversity,Huainan,Anhui,232001)Abstract:Inthis... 相似文献
50.
Pravin M. Vaidya 《Mathematical Programming》1996,73(3):291-341
Let
be a convex set for which there is an oracle with the following property. Given any pointz∈ℝ
n
the oracle returns a “Yes” ifz∈S; whereas ifz∉S then the oracle returns a “No” together with a hyperplane that separatesz fromS. The feasibility problem is the problem of finding a point inS; the convex optimization problem is the problem of minimizing a convex function overS. We present a new algorithm for the feasibility problem. The notion of a volumetric center of a polytope and a related ellipsoid
of maximum volume inscribable in the polytope are central to the algorithm. Our algorithm has a significantly better global
convergence rate and time complexity than the ellipsoid algorithm. The algorithm for the feasibility problem easily adapts
to the convex optimization problem. 相似文献