A FEASIBLE DIRECTION ALGORITHM WITHOUT LINE SEARCH FOR SOLVING MAX-BISECTION PROBLEMS

相关推荐

• A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF MAX-BISECTION
• EQUILIBRIUM ALGORITHMS WITH NONMONOTONE LINE SEARCH TECHNIQUE FOR SOLVING THE TRAFFIC ASSIGNMENT PROBLEMS
• An Algorithm for Solving a Class of Transportation Problems
• A CLASS OF REVISED BROYDEN ALGORITHMS WITHOUT EXACT LINE SEARCH
• AN ADAPTIVE MEMBRANE ALGORITHM FOR SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS

同分类资源 更多

• [计算数学] TRACE AVERAGING DOMAIN DECOMPOSITION METHOD WITH NONCONFORMING FINITE ELEMENTS
• [计算数学] A DYNAMICS APPROACH TO THE COMPUTATION OF EIGENVECTORS OF MATRICES
• [计算数学] A TWO-GRID METHOD FOR THE STEADY PENALIZED NAVIER-STOKES EQUATIONS
• [计算数学] HETEROGENEOUS MULTISCALE METHOD FOR OPTIMAL CONTROL PROBLEM GOVERNED BY ELLIPTIC EQUATIONS WITH HIGHLY OSCILLATORY COEFFICIENTS
• [计算数学] A QUASI-NEWTON ALGORITHM WITHOUT CALCULATING DERIVATIVES FOR UNCONSTRAINED OPTIMIZATION

相关关键词