{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1363388845711950208.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1137/1.9781611971453"}}],"dc:title":[{"@value":"Primal-Dual Interior-Point Methods"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1383388845711950208","@type":"Researcher","foaf:name":[{"@value":"Stephen J. Wright"}]}],"publication":{"publicationIdentifier":[{"@type":"ISBN","@value":"9780898713824"},{"@type":"ISBN","@value":"9781611971453"}],"prism:publicationName":[{"@value":"Primal-Dual Interior-Point Methods. SIAM"}],"dc:publisher":[{"@value":"Society for Industrial and Applied Mathematics"}],"prism:publicationDate":"1997-01"},"reviewed":"false","createdAt":"2011-10-21","modifiedAt":"2017-01-29","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360004236857427712","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Numerical shape-from-shading revisited"}]},{"@id":"https://cir.nii.ac.jp/crid/1360021390749746176","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Acceleration of Approximate Matrix Multiplications on GPUs"}]},{"@id":"https://cir.nii.ac.jp/crid/1360302865729536256","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"An infeasible interior-point arc-search method with Nesterov’s restarting strategy for linear programming problems"}]},{"@id":"https://cir.nii.ac.jp/crid/1360567181423927296","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"An arc-search $${\\mathcal {O}}(nL)$$ O ( n L ) infeasible-interior-point algorithm for linear programming"}]},{"@id":"https://cir.nii.ac.jp/crid/1360568465908018304","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning"}]},{"@id":"https://cir.nii.ac.jp/crid/1360857593697051648","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"An infeasible interior-point arc-search algorithm for nonlinear constrained optimization"}]},{"@id":"https://cir.nii.ac.jp/crid/1360857593704948864","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization"}]},{"@id":"https://cir.nii.ac.jp/crid/1360863101515477120","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Computational algorithms for solving optimal control in linear elasticity"}]},{"@id":"https://cir.nii.ac.jp/crid/1360863101830667008","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"A polynomial interior-point algorithm with improved iteration bounds for linear optimization"}]},{"@id":"https://cir.nii.ac.jp/crid/1360865815483571712","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Riemannian Interior Point Methods for Constrained Optimization on Manifolds"}]},{"@id":"https://cir.nii.ac.jp/crid/1360869855590948992","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Sparse Topology Estimation for Consensus Network Systems via Minimax Concave Penalty"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282679086164224","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"ON NETWORK SIMPLEX METHOD USING THE PRIMAL-DUAL SYMMETRIC PIVOTING RULE"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282679588482048","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"HYBRID TYPE RIGID PLASTIC FINITE ELEMENT ANALYSIS FOR BEARING CAPACITY CHARACTERISTICS OF SURFACE UNIFORM LOADING"}]},{"@id":"https://cir.nii.ac.jp/crid/1390287142240573952","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Driver steering assistance for collision avoidance and turning performance optimization by constrained MPC"}]},{"@id":"https://cir.nii.ac.jp/crid/1390860940787707648","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"A RIEMANNIAN-GEOMETRICAL APPROACH TO STRICTLY CONVEX QUADRATIC PROGRAMMING WITH CONVEXITY-PRESERVING METRIC PARAMETERIZATION"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1137/1.9781611971453"},{"@type":"CROSSREF","@value":"10.1186/s41074-018-0044-9_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"},{"@type":"CROSSREF","@value":"10.3208/sandf.45.2_17_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"},{"@type":"CROSSREF","@value":"10.15807/jorsj.66.219_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"},{"@type":"CROSSREF","@value":"10.3390/e25081130_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"},{"@type":"CROSSREF","@value":"10.1007/s10589-024-00561-z_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"},{"@type":"CROSSREF","@value":"10.1007/s11590-017-1142-9_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"},{"@type":"CROSSREF","@value":"10.1007/s10589-019-00103-y_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"},{"@type":"CROSSREF","@value":"10.15807/jorsj.43.149_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"},{"@type":"CROSSREF","@value":"10.1007/s11075-021-01113-w_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"},{"@type":"CROSSREF","@value":"10.1007/s10898-021-01048-5_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"},{"@type":"CROSSREF","@value":"10.1007/s13160-024-00654-6_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"},{"@type":"CROSSREF","@value":"10.1007/s13160-023-00630-6_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"},{"@type":"CROSSREF","@value":"10.1007/s10957-024-02403-8_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"},{"@type":"CROSSREF","@value":"10.1109/lcsys.2024.3407630_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"},{"@type":"CROSSREF","@value":"10.1299/mej.20-00361_references_DOI_ZfOmUqdm7lz2hlLNG6AbhyOLNjL"}]}