The PnP problem is a widely used technique for pose determination in computer vision community,and finding out geometric conditions of multiple solutions is the ultimate and most desirable goal of the multi-solution a...The PnP problem is a widely used technique for pose determination in computer vision community,and finding out geometric conditions of multiple solutions is the ultimate and most desirable goal of the multi-solution analysis,which is also a key research issue of the problem.In this paper,we prove that given 3 control points,if the camera's optical center lies on the so-called“danger cylinder”and is enough far from the supporting plane of control points,the corresponding P3P problem must have 3 positive solutions.This result can bring some new insights into a better understanding of the multi-solution problem.For example,it is shown in the literature that the solution of the P3P problem is instable if the optical center lies on this danger cylinder,we think such occurrence of triple-solution is the primary source of this instability.展开更多
In this paper,the L_(p)chord Minkowski problem is concerned.Based on the results shown in[20],we obtain a new existence result of solutions to this problem in terms of smooth measures by using a nonlocal Gauss curvatu...In this paper,the L_(p)chord Minkowski problem is concerned.Based on the results shown in[20],we obtain a new existence result of solutions to this problem in terms of smooth measures by using a nonlocal Gauss curvature flow for p>−n with p≠0.展开更多
The existence of multiple positive solutions for a class of higher order p Laplacian boundary value problem is studied. By means of the Leggett Williams fixed point theorem in cones, existence criteria which e...The existence of multiple positive solutions for a class of higher order p Laplacian boundary value problem is studied. By means of the Leggett Williams fixed point theorem in cones, existence criteria which ensure the existence of at least three positive solutions of the boundary value problem are established.展开更多
In this paper, we consider the existence of three nontrivial solutions for a discrete non-linear multiparameter periodic problem involving the p-Laplacian. By using the similar method for the Dirichlet boundary value ...In this paper, we consider the existence of three nontrivial solutions for a discrete non-linear multiparameter periodic problem involving the p-Laplacian. By using the similar method for the Dirichlet boundary value problems in [C. Bonanno and P. Candito, Appl. Anal., 88（4） （2009）, pp. 605-616], we construct two new strong maximum principles and obtain that the boundary value problem has three positive solutions for λ and μ in some suitable intervals. The approaches we use are the critical point theory.展开更多
In this paper, it is proved that, given 3 control points A, B and C, if the camera＇s optical center O lies on one of the three planes perpendicular to the plane ABC and going through one of the three altitudes of the...In this paper, it is proved that, given 3 control points A, B and C, if the camera＇s optical center O lies on one of the three planes perpendicular to the plane ABC and going through one of the three altitudes of the triangle ABC, and additionally its projection on the plane ABC is within the circumscribed circle of the triangle, that is, O is within the so-called “danger cylinder”, then the corresponding P3P problem {O, （ABC）} must have 4 positive solutions. This result is purely geometrical, and more instructive. It can bring some new insight into a better understanding of multiple-solution problem in the PnP problem, and could be used as some theoretical guide to arrange control points in real applications.展开更多
In the theory of computational complexity, the travelling salesman problem is a typical one in the NP class. With the aid of a brand-new approach named “maximum-deleting method”, a fast algorithm is constructed for ...In the theory of computational complexity, the travelling salesman problem is a typical one in the NP class. With the aid of a brand-new approach named “maximum-deleting method”, a fast algorithm is constructed for it with a polynomial time of biquadrate, which greatly reduces the computational complexity. Since this problem is also NP-complete, as a corollary, P = NP is proved to be true. It indicates the crack of the well-known open problem named “P versus NP”.展开更多
We view a facility system as a kind of supply chain and model it as a connected graph in which the nodes represent suppliers, distribution centers or customers and the edges represent the paths of goods or information...We view a facility system as a kind of supply chain and model it as a connected graph in which the nodes represent suppliers, distribution centers or customers and the edges represent the paths of goods or information. The efficiency, and hence the reliability, of a facility system is to a large degree adversely affected by the edge failures in the network. In this paper, we consider facility systems' reliability analysis based on the classical p-median problem when subject to edge failures. We formulate two models based on deterministic case and stochastic case to measure the loss in efficiency due to edge failures and give computational results and reliability envelopes for a specific example.展开更多
this paper,we introduce the L_(p) Shephard problem on entropy of log-concave functions,a comparison problem:whether ∏_(p)f≤∏_(p)g implies that Ent(f)≥Ent(g),for 1≤p<n,and Ent(f)≤Ent(g),for n<p,where ∏_(p)...this paper,we introduce the L_(p) Shephard problem on entropy of log-concave functions,a comparison problem:whether ∏_(p)f≤∏_(p)g implies that Ent(f)≥Ent(g),for 1≤p<n,and Ent(f)≤Ent(g),for n<p,where ∏_(p)f is the L_(p) projection body of a log-concave function f.Our results give a partial answer to this problem.展开更多
In this paper,the generalized inverse eigenvalue problem for the（P,Q）-conjugate matrices and the associated approximation problem are discussed by using generalized singular value decomposition（GSVD）.Moreover,the ...In this paper,the generalized inverse eigenvalue problem for the（P,Q）-conjugate matrices and the associated approximation problem are discussed by using generalized singular value decomposition（GSVD）.Moreover,the least residual problem of the above generalized inverse eigenvalue problem is studied by using the canonical correlation decomposition（CCD）.The solutions to these problems are derived.Some numerical examples are given to illustrate the main results.展开更多
In this work, we investigate the following fourth-order delay differential equation of boundary value problem with p-Laplacian（Φp（u000））0（t）＋a（t）f（t, u（t？τ）, u0（t））=0, 0〈t〈1;u000 （0）=u00 （0）=0,...In this work, we investigate the following fourth-order delay differential equation of boundary value problem with p-Laplacian（Φp（u000））0（t）＋a（t）f（t, u（t？τ）, u0（t））=0, 0〈t〈1;u000 （0）=u00 （0）=0, u0 （1）=αu0 （η）;u（t）=0, ？τ ≤t≤0. By using Schauder fixed-point theorem, some su？cient conditions are obtained which guar-antee the fourth-order delay differential equation of boundary value problem with p-Laplacian has at least one positive solution. Some corresponding examples are presented to illustrate the application of our main results.展开更多
By using a smoothing function,the P nonlinear complementarity problem(P NCP)can be reformulated as a parameterized smooth equation.A Newton method is proposed to solve this equation.The iteration sequence generated by...By using a smoothing function,the P nonlinear complementarity problem(P NCP)can be reformulated as a parameterized smooth equation.A Newton method is proposed to solve this equation.The iteration sequence generated by the proposed algorithm is bounded and this algorithm is proved to be globally convergent under an assumption that the P NCP has a nonempty solution set.This assumption is weaker than the ones used in most existing smoothing algorithms.In particular,the solution obtained by the proposed algorithm is shown to be a maximally complementary solution of the P NCP without any additional assumption.展开更多
In this paper,we prove the uniqueness of the Lp Minkowski problem for q-torsional rigidity with p>1 and q>1 in smooth case.Meanwhile,the Lp Brunn-Minkowski inequality and the Lp Hadamard variational formula for ...In this paper,we prove the uniqueness of the Lp Minkowski problem for q-torsional rigidity with p>1 and q>1 in smooth case.Meanwhile,the Lp Brunn-Minkowski inequality and the Lp Hadamard variational formula for q-torsional rigidity are established.展开更多
L^p- L^q decay estimate of solution to Cauchy problem of a linear thermoviscoelastic system is studied. By using a diagonalization argument of frequency analysis, the coupled system will be decoupled micrologically. T...L^p- L^q decay estimate of solution to Cauchy problem of a linear thermoviscoelastic system is studied. By using a diagonalization argument of frequency analysis, the coupled system will be decoupled micrologically. Then with the help of the information of characteristic roots for the coefficient matrix of the system, L^p- L^q decay estimate of parabolic type of solution to the Cauchy problem is obtained.展开更多
Mehrotra-type predictor-corrector algorithm, as one of most efficient interior point methods, has become the backbones of most optimization packages. Salahi et al. proposed a cut strategy based algorithm for linear op...Mehrotra-type predictor-corrector algorithm, as one of most efficient interior point methods, has become the backbones of most optimization packages. Salahi et al. proposed a cut strategy based algorithm for linear optimization that enjoyed polynomial complexity and maintained its efficiency in practice. We extend their algorithm to P. （~） linear complementar- ity problems. The way of choosing corrector direction for our algorithm is different from theirs： The new algorithm has been proved to have an O（（1 ＋ 4k）（17 ＋ 19k）√1＋2kn 3/2 log（x0）Ts0/ε） worst case iteration complexity bound. An numerical experiment verifies the feasibility of the new algorithm.展开更多
The author extends the results in [5] to the general p(v). For arbitrary large initial data, the global smooth solution of the initial value problem is proved to be uniformly (namely, independent of time t) away from ...The author extends the results in [5] to the general p(v). For arbitrary large initial data, the global smooth solution of the initial value problem is proved to be uniformly (namely, independent of time t) away from vacuum provided that the initial data are away from vacuum.展开更多
We study a Dirichlet optimal design problem for a quasi-linear monotone p-biharmonic equation with control and state constraints. We take the coefficient of the p-biharmonic operator as a design variable in . In this ...We study a Dirichlet optimal design problem for a quasi-linear monotone p-biharmonic equation with control and state constraints. We take the coefficient of the p-biharmonic operator as a design variable in . In this article, we discuss the relaxation of such problem.展开更多
In this paper, by applying a fixed point theorem to verify the existence of at least three positive solutions to a three-point boundary value problem with p-Laplacian. The interesting point is the nonlinear term is in...In this paper, by applying a fixed point theorem to verify the existence of at least three positive solutions to a three-point boundary value problem with p-Laplacian. The interesting point is the nonlinear term is involved with the first-order derivative explicitly.展开更多
In this paper, we discuss the nonemptyness and boundedness of the solution set for P*-semidefinite complementarity problem by using the concept of exceptional family of elements for complementarity problems over the c...In this paper, we discuss the nonemptyness and boundedness of the solution set for P*-semidefinite complementarity problem by using the concept of exceptional family of elements for complementarity problems over the cone of semidefinite matrices, and obtain a main result that if the corresponding problem has a strict feasible point, then its solution set is nonemptyness and boundedness.展开更多
基金Supported by"973"Program(2002CB312104)National Natural Science Foundation of P.R.China(60375006)the Research Foundation of North China Unversity of Technology University
文摘The PnP problem is a widely used technique for pose determination in computer vision community,and finding out geometric conditions of multiple solutions is the ultimate and most desirable goal of the multi-solution analysis,which is also a key research issue of the problem.In this paper,we prove that given 3 control points,if the camera's optical center lies on the so-called“danger cylinder”and is enough far from the supporting plane of control points,the corresponding P3P problem must have 3 positive solutions.This result can bring some new insights into a better understanding of the multi-solution problem.For example,it is shown in the literature that the solution of the P3P problem is instable if the optical center lies on this danger cylinder,we think such occurrence of triple-solution is the primary source of this instability.
基金supported by the National Natural Science Foundation of China(12171144,12231006,12122106).
文摘In this paper,the L_(p)chord Minkowski problem is concerned.Based on the results shown in[20],we obtain a new existence result of solutions to this problem in terms of smooth measures by using a nonlocal Gauss curvature flow for p>−n with p≠0.
文摘The existence of multiple positive solutions for a class of higher order p Laplacian boundary value problem is studied. By means of the Leggett Williams fixed point theorem in cones, existence criteria which ensure the existence of at least three positive solutions of the boundary value problem are established.
基金Supported by NSFC(11326127,11101335)NWNULKQN-11-23the Fundamental Research Funds for the Gansu Universities
文摘In this paper, we consider the existence of three nontrivial solutions for a discrete non-linear multiparameter periodic problem involving the p-Laplacian. By using the similar method for the Dirichlet boundary value problems in [C. Bonanno and P. Candito, Appl. Anal., 88（4） （2009）, pp. 605-616], we construct two new strong maximum principles and obtain that the boundary value problem has three positive solutions for λ and μ in some suitable intervals. The approaches we use are the critical point theory.
文摘In this paper, it is proved that, given 3 control points A, B and C, if the camera＇s optical center O lies on one of the three planes perpendicular to the plane ABC and going through one of the three altitudes of the triangle ABC, and additionally its projection on the plane ABC is within the circumscribed circle of the triangle, that is, O is within the so-called “danger cylinder”, then the corresponding P3P problem {O, （ABC）} must have 4 positive solutions. This result is purely geometrical, and more instructive. It can bring some new insight into a better understanding of multiple-solution problem in the PnP problem, and could be used as some theoretical guide to arrange control points in real applications.
文摘In the theory of computational complexity, the travelling salesman problem is a typical one in the NP class. With the aid of a brand-new approach named “maximum-deleting method”, a fast algorithm is constructed for it with a polynomial time of biquadrate, which greatly reduces the computational complexity. Since this problem is also NP-complete, as a corollary, P = NP is proved to be true. It indicates the crack of the well-known open problem named “P versus NP”.
文摘We view a facility system as a kind of supply chain and model it as a connected graph in which the nodes represent suppliers, distribution centers or customers and the edges represent the paths of goods or information. The efficiency, and hence the reliability, of a facility system is to a large degree adversely affected by the edge failures in the network. In this paper, we consider facility systems' reliability analysis based on the classical p-median problem when subject to edge failures. We formulate two models based on deterministic case and stochastic case to measure the loss in efficiency due to edge failures and give computational results and reliability envelopes for a specific example.
基金The National Natural Science Foundation of China(11701373)The Shanghai Sailing Program(17YF1413800)。
文摘this paper,we introduce the L_(p) Shephard problem on entropy of log-concave functions,a comparison problem:whether ∏_(p)f≤∏_(p)g implies that Ent(f)≥Ent(g),for 1≤p<n,and Ent(f)≤Ent(g),for n<p,where ∏_(p)f is the L_(p) projection body of a log-concave function f.Our results give a partial answer to this problem.
基金Supported by the Key Discipline Construction Project of Tianshui Normal University
文摘In this paper,the generalized inverse eigenvalue problem for the（P,Q）-conjugate matrices and the associated approximation problem are discussed by using generalized singular value decomposition（GSVD）.Moreover,the least residual problem of the above generalized inverse eigenvalue problem is studied by using the canonical correlation decomposition（CCD）.The solutions to these problems are derived.Some numerical examples are given to illustrate the main results.
基金Foundation item： Supported by the National Natural Science Foundation of China（10801001） Supported by the Natural Science Foundation of Anhui Province（1208085MA13, KJ2009A005Z）
文摘In this work, we investigate the following fourth-order delay differential equation of boundary value problem with p-Laplacian（Φp（u000））0（t）＋a（t）f（t, u（t？τ）, u0（t））=0, 0〈t〈1;u000 （0）=u00 （0）=0, u0 （1）=αu0 （η）;u（t）=0, ？τ ≤t≤0. By using Schauder fixed-point theorem, some su？cient conditions are obtained which guar-antee the fourth-order delay differential equation of boundary value problem with p-Laplacian has at least one positive solution. Some corresponding examples are presented to illustrate the application of our main results.
基金Supported by China Postdoctoral Science Foundation(No.20060390660)Science and Technology Development Plan of Tianjin(No.06YFGZGX05600)+1 种基金Scientific Research Foundation of Liu Hui Center for Applied MathematicsNankai University-Tianjin University.
文摘By using a smoothing function,the P nonlinear complementarity problem(P NCP)can be reformulated as a parameterized smooth equation.A Newton method is proposed to solve this equation.The iteration sequence generated by the proposed algorithm is bounded and this algorithm is proved to be globally convergent under an assumption that the P NCP has a nonempty solution set.This assumption is weaker than the ones used in most existing smoothing algorithms.In particular,the solution obtained by the proposed algorithm is shown to be a maximally complementary solution of the P NCP without any additional assumption.
基金The authors were supported by NSFC(11771132)Hunan Science and Technology Project(2018JJ1004).
文摘In this paper,we prove the uniqueness of the Lp Minkowski problem for q-torsional rigidity with p>1 and q>1 in smooth case.Meanwhile,the Lp Brunn-Minkowski inequality and the Lp Hadamard variational formula for q-torsional rigidity are established.
基金supported by the National Natural Science Foundation of China (10771055)HNSF(07JJ3007)
文摘L^p- L^q decay estimate of solution to Cauchy problem of a linear thermoviscoelastic system is studied. By using a diagonalization argument of frequency analysis, the coupled system will be decoupled micrologically. Then with the help of the information of characteristic roots for the coefficient matrix of the system, L^p- L^q decay estimate of parabolic type of solution to the Cauchy problem is obtained.
基金Supported by the Natural Science Foundation of Hubei Province(Grant No.2008CDZ047)
文摘Mehrotra-type predictor-corrector algorithm, as one of most efficient interior point methods, has become the backbones of most optimization packages. Salahi et al. proposed a cut strategy based algorithm for linear optimization that enjoyed polynomial complexity and maintained its efficiency in practice. We extend their algorithm to P. （~） linear complementar- ity problems. The way of choosing corrector direction for our algorithm is different from theirs： The new algorithm has been proved to have an O（（1 ＋ 4k）（17 ＋ 19k）√1＋2kn 3/2 log（x0）Ts0/ε） worst case iteration complexity bound. An numerical experiment verifies the feasibility of the new algorithm.
文摘The author extends the results in [5] to the general p(v). For arbitrary large initial data, the global smooth solution of the initial value problem is proved to be uniformly (namely, independent of time t) away from vacuum provided that the initial data are away from vacuum.
文摘We study a Dirichlet optimal design problem for a quasi-linear monotone p-biharmonic equation with control and state constraints. We take the coefficient of the p-biharmonic operator as a design variable in . In this article, we discuss the relaxation of such problem.
文摘In this paper, by applying a fixed point theorem to verify the existence of at least three positive solutions to a three-point boundary value problem with p-Laplacian. The interesting point is the nonlinear term is involved with the first-order derivative explicitly.
文摘In this paper, we discuss the nonemptyness and boundedness of the solution set for P*-semidefinite complementarity problem by using the concept of exceptional family of elements for complementarity problems over the cone of semidefinite matrices, and obtain a main result that if the corresponding problem has a strict feasible point, then its solution set is nonemptyness and boundedness.
