yusuke1997/dblp-id-title huggingface dataset:
A Method to Estimate Longitudinal Change Patterns in Functional Network Connectivity of the Developing Brain Relevant to Psychiatric Problems, Cognition, and Age
Implication of the Slow-5 Oscillations in the Disruption of the Default-Mode Network in Healthy Aging and Stroke
Testing Group Differences in Brain Functional Connectivity: Using Correlations or Partial Correlations?
Brain Connectivity : A New Journal Emerges
Effects of Transcranial Magnetic Stimulation on Cognitive-Affective Task-Based Functional Connectivity
Examination of Frontal and Parietal Tectocortical Attention Pathways in Spina Bifida Meningomyelocele Using Probabilistic Diffusion Tractography
Directed Flow of Beta Band Communication During Reorienting of Attention Within the Dorsal Attention Network
Alzheimer's Disease Is Associated with Increased Network Assortativity: Evidence from Metabolic Connectivity
Structural Connectivity Patterns of Side Effects Induced by Subthalamic Deep Brain Stimulation for Parkinson's Disease
Resting-State Functional Magnetic Resonance Imaging Analysis with Seed Definition Constrained by Regional Homogeneity
Decoupling of Structural and Functional Connectivity in Hubs and Cognitive Impairment After Mild Traumatic Brain Injury
Effective Connectivity for Default Mode Network Analysis of Alcoholism
The Network Modification (NeMo) Tool: Elucidating the Effect of White Matter Integrity Changes on Cortical and Subcortical Structural Connectivity
Improved Delineation of Short Cortical Association Fibers and Gray/White Matter Boundary Using Whole-Brain Three-Dimensional Diffusion Tensor Imaging at Submillimeter Spatial Resolution
A New Approach for Functional Connectivity via Alignment of Blood Oxygen Level-Dependent Signals
Functional Clustering of the Human Inferior Parietal Lobule by Whole-Brain Connectivity Mapping of Resting-State Functional Magnetic Resonance Imaging Signals
Test-Retest Reliability of Computational Network Measurements Derived from the Structural Connectome of the Human Brain
Independent Component Analysis of Localized Resting-State Functional Magnetic Resonance Imaging Reveals Specific Motor Subnetworks
European Working Group on SARS-CoV-2: Current Understanding, Unknowns, and Recommendations on the Neurological Complications of COVID-19
Dynamic Functional Network Analysis in Mild Traumatic Brain Injury
Brain Connectivity: A Journal of Clinical Neurology, Neuroscience, and Neuroimaging
Bridging the Gap: Dynamic Causal Modeling and Granger Causality Analysis of Resting State Functional Magnetic Resonance Imaging
Quantitative Analysis of Myelin and Axonal Remodeling in the Uninjured Motor Network After Stroke
Neuronal and Physiological Correlation to Hemodynamic Resting-State Fluctuations in Health and Disease
Fast Eigenvector Centrality Mapping of Voxel-Wise Connectivity in Functional Magnetic Resonance Imaging: Implementation, Validation, and Interpretation
Integration and Segregation of the Brain Relate to Stability of Performance in Children and Adolescents with Varied Levels of Inattention and Impulsivity
Scale-Dependent Variability and Quantitative Regimes in Graph-Theoretic Representations of Human Cortical Networks
Evidence for Behaviorally Segregated, Spatiotemporally Overlapping Subnetworks in Phantom Sound Perception
Brain Network Measures for Groups of Nodes: Application to Normal Aging and Alzheimer's Disease
Transcallosal Connectivity Changes from Infancy to Late Adulthood: An Ex Vivo Diffusion Spectrum Imaging Study of Macaque Brains
Erroneous Resting-State fMRI Connectivity Maps Due to Prolonged Arterial Arrival Time and How to Fix Them
Resting-State Functional Connectivity Modulation and Sustained Changes After Real-Time Functional Magnetic Resonance Imaging Neurofeedback Training in Depression
Combining a path method and parametric linear programming for the computation of competitive equilibria
Individual confidence intervals for solutions to expected value formulations of stochastic variational inequalities
Optimization-based simulation of nonsmooth rigid multibody dynamics
On the domino-parity inequalities for the STSP
An O( n ) algorithm for the multiple-choice knapsack linear program
A polynomial-time algorithm for a class of linear complementarity problems
Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints
A Successive quadratic programming method for a Class of constrained nonsmooth optimization problems
Oracle complexity of second-order methods for smooth convex optimization
Solving maximum-entropy sampling problems using factored masks
Exponential weight algorithm in continuous time
Utilization of mathematical programming for public systems: An application to effective formation of integrated regional information networks
Infinite retrogression in the Eaves - Saigal algorithm
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
Mathematical programming study 30 - Nonlinear Analysis and Optimization
Lower bounds for finding stationary points I
Potential-reduction methods in mathematical programming
On Brøndsted-Rockafellar's Theorem for convex lower semicontinuous epi-pointed functions in locally convex spaces
Error bounds for proximal point subproblems and associated inexact proximal point algorithms
Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
The P-matrix problem is co-NP-complete
A set of staircase linear programming test problems
Polyhedral aspects of score equivalence in Bayesian network structure learning
The facets of the polyhedral set determined by the Gale-Hoffman inequalities
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
Matrix augmentation and partitioning in the updating of the basis inverse
The BFGS method with exact line searches fails for non-convex objective functions
An implementation of Karmarkar's algorithm for linear programming
Packing algorithms for arborescences (and spanning trees) in capacitated graphs
A new continuation method for complementarity problems with uniform P -functions
Optimal general factor problem and jump system intersection
Sequential convexification in reverse convex and disjunctive programming
Adversarial classification via distributional robustness with Wasserstein ambiguity
Erratum to: Computational complexity of stochastic programming problems
Approximate solution of the trust region problem by minimization over two-dimensional subspaces
On the convergence of the exponential multiplier method for convex programming
Equations on monotone graphs
Approximate minimum-cost multicommodity flows in Õ(epsilon -2 KNM) time
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
Approximation algorithms for the generalized incremental knapsack problem
Phragmén's voting methods and justified representation
Note on the path following approach of equilibrium programming
Smooth hyperbolicity cones are spectrahedral shadows
The curvature integral and the complexity of linear complementarity problems
Nonlinear programming and stationary strategies in stochastic games
A generalized inverse method for asymptotic linear programming
A branch and cut algorithm for hub location problems with single assignment
An FPTAS for optimizing a class of low-rank functions over a polytope
Strong KKT conditions and weak sharp solutions in convex-composite optimization
Minimal representation of quadratically constrained convex feasible regions
Shallow, deep and very deep cuts in the analytic center cutting plane method
A generlized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems
Testing additive integrality gaps
Qualification conditions for multivalued functions in Banach spaces with applications to nonsmooth vector optimization problems
Velocity Inversion: A Case Study in Infinite-Dimensional Optimization
The matching augmentation problem: a $\frac{7}{4}$-approximation algorithm
A descent method for submodular function minimization
The Ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
Nonlinear mappings associated with the generalized linear complementarity problem
Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
An asynchronous proximal bundle method
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
On the generation of circuits and minimal forbidden sets
Projective re-normalization for improving the behavior of a homogeneous conic linear system
Two-stage stochastic hierarchical multiple risk problems: models and algorithms
Hesitant adaptive search: the distribution of the number of iterations to convergence
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020
The tracial moment problem and trace-optimization of polynomials
An algorithm for finding the global maximum of a multimodal, multivariate function
On the width - length inequality
"Facet" separation with one linear program
Discrete 2-convex functions
Improving the robustness of descent-based methods for semismooth equations using proximal perturbations
Set-valued approximations and Newton's methods
Resolving degeneracy in combinatorial linear programs: steepest edge, steepest ascent, and parametric ascent
Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
Convergence behavior of interior-point algorithms
An efficient global algorithm for a class of indefinite separable quadratic programs
Odd cycles and matrices with integrality properties
No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
A Filled Function Method for Finding a Global Minimizer of a Function of Several Variables
Apportionment with parity constraints
Lot-size models with backlogging: Strong reformulations and cutting planes
Proximal quasi-Newton methods for nondifferentiable convex optimization
Simple integer recourse models: convexity and convex approximations
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
An LPCC approach to nonconvex quadratic programs
Positive semidefinite rank
An alternative variational principle for variable metric updating
Optimal mapping in direct mapped cache environments
An interior-point method for fractional programs with convex constraints
Hirsch polytopes with exponentially long combinatorial segments
Forcing sparsity by projecting with respect to a non-diagonally weighted frobenius norm
Data-driven robust optimization
Special issue of the ISMP 2012 in Berlin
Rudiments of an average case complexity theory for piecewise-linear path following algorithms
Errata in implicit multifunction theorems for the sensitivity analysis of variational conditions
Dual consistent systems of linear inequalities and cardinality constrained polytopes
Adaptive regularization with cubics on manifolds
Optimum matching forests I: Special weights
A Recursive Procedure to Generate All Cuts for 0-1 Mixed Integer Programs
Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
Consistent queueing rules
On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints
Completely-Q matrices
On triangulations for computing fixed points
Reformulations in mathematical programming: automatic symmetry detection and exploitation
Solving large-scale semidefinite programs in parallel
The Aussois 2000 workshop in combinatorial optimization introduction
Lower bounds for the quadratic assignment problem via triangle decompositions
Cluster analysis and mathematical programming
On mathematical programming with indicator constraints
Some continuous functions related to corner polyhedra, II
Special Issue: Hierarchical Optimization
An infeasible-interior-point potential-reduction algorithm for linear programming
A bump triangular dynamic factorization algorithm for the simplex method
Two row mixed-integer cuts via lifting
Equilibrium programming using proximal-like algorithms
Limiting behavior of weighted central paths in linear programming
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem
Duality for constrained robust sum optimization problems
Stochastic makespan minimization in structured set systems
Linearly convergent away-step conditional gradient for non-strongly convex functions
A quasi-Newton method can be obtained from a method of conjugate directions
$\mathbf {2\times 2}$-Convexifications for convex quadratic optimization with indicator variables
Pairwise reactive sor algorithm for quadratic programming of net import spatial equilibrium models
Convex optimization and lagrange multipliers
Matroid-based TSP rounding for half-integral solutions
Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
Erratum to: An abstract model for branching and its application to mixed integer programming
Implicit multifunction theorems in complete metric spaces
On the complexity of finding first-order critical points in constrained nonlinear optimization
New criteria for the simplex algorithm
A Feasibility Pump for mixed integer nonlinear programs
Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
On the uniqueness of solutions to linear complementarity problems
Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm
On random quadratic bottleneck assignment problems
Primal separation for 0/1 polytopes
Updating of conjugate direction matrices using members of Broyen's family
Condition measures and properties of the central trajectory of a linear program
Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
Dealing with degeneracy in reduced gradient algorithms
An aggregate subgradient method for nonsmooth convex minimization
New error bounds and their applications to convergence analysis of iterative algorithms
On existence and uniqueness of stationary points in semi-infinite optimization
Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization
A VU-algorithm for convex minimization
On the capacitated vehicle routing problem
Efficiency of minimizing compositions of convex functions and smooth maps
Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
Steepest-edge simplex algorithms for linear programming
Correction: Global convergence of the gradient method for functions definable in o-minimal structures
Graver basis and proximity techniques for block-structured separable convex integer minimization problems
On the convergence of the Newton/log-barrier method
A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
A note on the condition numbers of convex sets
Intrinsic volumes of symmetric cones and applications in convex programming
Status determination by interior-point methods for convex optimization problems in domain-driven form
An economic interpretation of stochastic programs
Beyond symmetry: best submatrix selection for the sparse truncated SVD
Maximizing a class of submodular utility functions
Using shortest paths in some transshipment problems with concave costs
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
Mean robust optimization
A polynomial algorithm for an integer quadratic non-separable transportation problem
Superlinear convergence of infeasible-interior-point methods for linear programming
An approximation algorithm for the general max-min resource sharing problem
Decomposition algorithms for two-stage chance-constrained programs
Characterization of TU games with stable cores by nested balancedness
A variable dimension fixed point algorithm and the orientation of simplices
On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
On the time transformation of mixed integer optimal control problems using a consistent fixed integer control function
Computing Walrasian equilibria: fast algorithms and structural properties
A generalized knapsack problem with variable coefficients
Adjacency on polymatroids
An ideal column algorithm for integer programs with special ordered sets of variables
Semidefinite optimization in discrepancy theory
Introduction to financial optimization: Mathematical Programming Special Issue
Large-scale linearly constrained optimization
Valid inequalities based on simple mixed-integer sets
Convex two-level optimization
On the diameter of partition polytopes and vertex-disjoint cycle cover
Improved semidefinite bounding procedure for solving Max-Cut problems to optimality
A note on Schrage's generalised variable upper bounds
Dual decomposition of a single-machine scheduling problem
Characterizing and recognizing generalized polymatroids
Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making
An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
Optimality functions in stochastic programming
Interior-point l 2 -penalty methods for nonlinear programming with strong global convergence properties
Competitive online algorithms for resource allocation over the positive semidefinite cone
A 2-approximation for the bounded treewidth sparsest cut problem in sfFPT Time
Integer programming approaches to the travelling salesman problem
A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows
A semi-definite programming approach for robust tracking
On linear and semidefinite programming relaxations for hypergraph matching
Global minimization of large-scale constrained concave quadratic problems by separable programming
A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
The landscape of the proximal point method for nonconvex-nonconcave minimax optimization
Level-set methods for convex optimization
Layering strategies for creating exploitable structure in linear and integer programs
Problem-driven scenario generation: an analytical approach for stochastic programs with tail risk measure
On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables
Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
A relaxed version of Karmarkar's method
epsilon-optimality criteria for convex programming problems via exact penalty functions
A decomposition algorithm for quadratic programming
The hierarchy of local minimums in polynomial optimization
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
On sublinear inequalities for mixed integer conic programs
Semismooth support vector machines
A finite characterization of perfect equilibria
An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion
Optimal estimation of sensor biases for asynchronous multi-sensor data fusion
Why webster?
The submodular joint replenishment problem
Global optimization in Hilbert space
On the subdifferential of a submodular function
The primal-dual algorithm as a constraint-set-manipulation device
Matrix Sum-of-Squares Relaxations for Robust Semi-Definite Programs
The aggregation closure is polyhedral for packing and covering integer programs
Nonlinear programming without a penalty function or a filter
Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization
A production-transportation problem with stochastic demand and concave production costs
A condition number theorem in convex programming
The fleet assignment problem: Solving a large-scale integer program
On rates of convergence for sample average approximations in the almost sure sense and in mean
Divide to conquer: decomposition methods for energy optimization
Stochastic Lipschitz dynamic programming
Valid inequalities for problems with additive variable upper bounds
Remarks on the generalized Newton method
Self-regular functions and new search directions for linear and semidefinite optimization
On the pervasiveness of difference-convexity in optimization and statistics
Integrated market selection and production planning: complexity and solution approaches
The gradient and heavy ball with friction dynamical systems: the quasiconvex case
On the facial structure of the set covering polytope
On Shapiro's Results in Quasidifferential Calculus
Asymptotic behaviour of a family of gradient algorithms in R d and Hilbert spaces
A constructive proof of Ky Fan's coincidence theorem
Primal-dual interior-point methods for PDE-constrained optimization
Minimum-Weight Two-Connected Spanning Networks
Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems
A property of continuous unbounded algorithms
Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004
Second order characterizations of pseudoconvex functions
Subdifferential of the supremum function: moving back and forth between continuous and non-continuous settings
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
Packing rooted directed cuts in a weighted directed graph
Search directions in the SDP and the monotone SDLCP: generalization and inexact computation
On homogeneous and self-dual algorithms for LCP
ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum
A polyhedral approach to single-machine scheduling problems
Nonlinear regularity models
Note on separation from membership, and folklore
Polynomial combinatorial algorithms for skew-bisubmodular function minimization
Reduction of quasidifferentials and minimal representations
Linearly constrained minimax optimization
Solving knapsack sharing problems with general tradeoff functions
A parallel algorithm for constrained concave quadratic global minimization
A convex-like duality scheme for quasi-convex programs
The continuous knapsack set
On the complexity of testing attainment of the optimal value in nonlinear optimization
A robust approach to warped Gaussian process-constrained optimization
Linear convergence of epsilon-subgradient descent methods for a class of convex functions
Direct theorems in semi-infinite convex programming
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
Regular packing of rooted hyperforests with root constraints in hypergraphs
Hamiltonian path and symmetric travelling salesman polytopes
Hölder metric regularity of set-valued maps
Comparative analysis of affine scaling algorithms based on simplifying assumptions
No-regret algorithms in on-line learning, games and convex optimization
A global optimization method for the molecular replacement problem in X-ray crystallography
Optimality conditions and finite convergence of Lasserre's hierarchy
A Standard Form Variant, and Safeguarded Linesearch, for the Modified Karmarkar Algorithm
Single item lot-sizing with non-decreasing capacities
On strongly polynomial dual simplex algorithms for the maximum flow problem
Updating conjugate directions by the BFGS formula
Complexity of convex optimization using geometry-based measures and a reference point
Tangential extremal principles for finite and infinite systems of sets II: applications to semi-infinite and multiobjective optimization
Inexact accelerated high-order proximal-point methods
The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates