The following pages link to Kojima, Masakazu (Q163016):
Displaying 50 items.
- (Q195220) (redirect page) (← links)
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization (Q283932) (← links)
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming (Q623727) (← links)
- A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037) (← links)
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion (Q717129) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- The relation between the path of centers and Smale's regularization of the linear programming problem (Q803732) (← links)
- Dynamic enumeration of all mixed cells (Q878389) (← links)
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967) (← links)
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones (Q1001199) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- Determining basic variables of optimal solutions in Karmarkar's new LP algorithm (Q1113799) (← links)
- A new continuation method for complementarity problems with uniform P- functions (Q1121180) (← links)
- A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
- A property of matrices with positive determinants (Q1140690) (← links)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
- A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826) (← links)
- An interior point potential reduction algorithm for the linear complementarity problem (Q1196718) (← links)
- A unified approach to interior point algorithms for linear complementary problems (Q1202150) (← links)
- Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation (Q1295958) (← links)
- A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
- On the big \({\mathcal M}\) in the affine scaling algorithm (Q1321664) (← links)
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming (Q1349146) (← links)
- Semidefinite programming relaxation for nonconvex quadratic programs (Q1361074) (← links)
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming (Q1365057) (← links)
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (Q1380924) (← links)
- Reduction of monotone linear complementarity problems over cones to linear programs over cones (Q1384429) (← links)
- A conjugate direction method for approximating the analytic center of a polytope (Q1386699) (← links)
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results (Q1411643) (← links)
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions (Q1415482) (← links)
- Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- PHoM -- a polyhedral homotopy continuation method for polynomial systems (Q1763006) (← links)
- Numerical stability of path tracing in polyhedral homotopy continuation methods (Q1764148) (← links)
- Sparsity in sums of squares of polynomials (Q1777218) (← links)
- Some fundamental properties of successive convex relaxation methods on LCP and related problems (Q1810868) (← links)
- Parallel implementation of successive convex relaxation methods for quadratic optimization problems (Q1812077) (← links)
- On the finite convergence of successive SDP relaxation methods (Q1848385) (← links)
- Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods (Q1872931) (← links)
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem (Q2276889) (← links)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
- PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems (Q2642945) (← links)
