yusuke1997/dblp-id-title huggingface dataset:
The divergence of the BFGS and Gauss Newton methods
An algorithm for maximizing entropy subject to simple bounds
Foreword: Special issue on IPCO 2005
A note on Q -matrices
Some numerical experiments with variable-storage quasi-Newton algorithms
A 2 + epsilon approximation algorithm for the k -MST problem
Recognizing even-cycle and even-cut matroids
On the complexity of separating cutting planes for the knapsack polytope
On linear programs with random costs
Exploring the Relationship Between Max-Cut and Stable Set Relaxations
On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
Bimatrix games have quasi-strict equilibria
Conditions for convergence of trust region algorithms for nonsmooth optimization
Exact and approximation algorithms for routing a convoy through a graph
The role of rationality in integer-programming relaxations
An example of irregular convergence in some constrained optimization methods that use the projected hessian
An efficient one - dimensional search procedure for barrier functions
Erratum to: Convex approximations for complete integer recourse models
Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
A disjunctive cutting plane procedure for general mixed-integer linear programs
Ideal polytopes and face structures of some combinatorial optimization problems
On constraint sets of infinite linear programs over ordered fields
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
Simplicial decomposition in nonlinear programming algorithms
Approximation schemes for NP-hard geometric optimization problems: a survey
Mathematics in economics: Achievements, difficulties, perspectives - Nobel Memorial Lecture - 11 December 1975
On reduced semidefinite programs for second order moment bounds with applications
Failure of global convergence for a class of interior point methods for nonlinear programming
Fractionation in radiation treatment planning
Polyhedral Newton-min algorithms for complementarity problems
The double exponential runtime is tight for 2-stage stochastic ILPs
Lifting mathematical programs with complementarity constraints
Tensor eigenvalue complementarity problems
A unifying model based on retraction for fixed point algorithms
An inexact algorithm for composite nondifferentiable optimization
Improving the integrality gap for multiway cut
The triangle closure is a polyhedron
Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
Stochastic programming with simple integer recourse
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
On stress matrices of (d + 1)-lateration frameworks in general position
A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs
Error bounds for monotone linear complementarity problems
A bundle-filter method for nonsmooth convex constrained optimization
A partitioning algorithm for the multicommodity network flow problem
Polyhedral extensions of some theorems of linear programming
Efficient Kirszbraun extension with applications to regression
A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
A construction method in parametric programming
Optimal expansion of an existing network
On the sensitivity of the optimal partition for parametric second-order conic optimization
A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
A variable rate refining triangulation
One way to solve the parametric quadratic programming problem
Robust stochastic dominance and its application to risk-averse optimization
Hit-and-run algorithms for the identification of nonredundant linear inequalities
The mixed integer trust region problem
Semi-algebraic functions have small subdifferentials
On a class of least-element complementarity problems
Readily implementable conjugate gradient methods
Smoothed analysis for tensor methods in unsupervised learning
Projections in minimax algebra
On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands
Chance-constrained set covering with Wasserstein ambiguity
Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems
A Lipschitz constant associated with lemke's closest-point principle
Solving combinatorial optimization problems using Karmarkar's algorithm
Second-order necessary conditions in semismooth optimization
Continuity properties of the Karush-Kuhn-Tucker point set in quadratic programming problems
Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs
Complexity of some cutting plane methods that use analytic centers
Fair colorful k-center clustering
Approximations and generalized Newton methods
Hybrid computation in mathematical programming
A control-theoretic perspective on optimal high-order optimization
On the polyhedrality of cross and quadrilateral closures
A convergence theorem of Rosen's gradient projection method
On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}
A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
A primal nonsmooth reformulation for bilevel optimization problems
The convex hull of two core capacitated network design problems
Computing proximal points of nonconvex functions
A perfect example for the BFGS method
A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds
Semidefinite programming for min-max problems and games
On structure and stability in stochastic programs with random technology matrix and complete integer recourse
Min-cut clustering
A characterization of weakly efficient points
On accelerating PL continuation algorithms by predictor - corrector methods
Statistics with set-valued functions: applications to inverse approximate optimization
Criteria for differentiable generalized monotone maps
On the existence of optimal solutions to integer and mixed-integer programming problems
A large class of facets for the K -median polytope
Optimality in transient markov chains and linear programming
Fixed point and Bregman iterative methods for matrix rank minimization
Generalization of some duality theorems in nonlinear programming
Copositive programming motivated bounds on the stability and the chromatic numbers
Linear multiplicative programming
Stable modification of explicit LU factors for simplex updates
Morse theory for some lower- C 2 functions in finite dimension
k-Point semidefinite programming bounds for equiangular lines
Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
Second order necessary and sufficient conditions for convex composite NDO
On an instance of the inverse shortest paths problem
The flow circulation sharing problem
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
Numerical evaluation of SBmethod
Combinatorial n-fold integer programming and applications
Some comments on Wolfe's 'away step'
Transportation problems which can be solved by the use of hirsch-paths for the dual problems
Facet inequalities from simple disjunctions in cutting plane theory
The core and nucleolus of games: A note on a paper by Göthe-Lundgren et al
The sphere method and the robustness of the ellipsoid algorithm
Cut-sufficient directed 2-commodity multiflow topologies
A weighted independent even factor algorithm
On verifiable sufficient conditions for sparse signal recovery via ℓ 1 minimization
Correction to: A sequential homotopy method for mathematical programming problems
Heuristics for the fixed cost median problem
A probabilistic analysis of a measure of combinatorial complexity for the central curve
Undercover: a primal MINLP heuristic exploring a largest sub-MIP
Coderivative-based semi-Newton method in nonsmooth difference programming
Correction to: Idealness of k-wise intersecting families
A polynomial algorithm for integer programming covering problems satisfying the integer round-up property
Bimatrix games - an addendum
On the equivalence of nonlinear complementarity problems and least-element problems
Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems
Partial pivoting strategies for symmetric gaussian elimination
Integer round-up property for the chromatic number of some h-perfect graphs
Error bounds for analytic systems and their applications
Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle
Small covering designs by branch-and-cut
A linear integer programming bound for maximum-entropy sampling
Convex optimization problems involving finite autocorrelation sequences
Global optimization of rational functions: a semidefinite programming approach
On the convergence of SUMT
Routing optimization with time windows under uncertainty
An infeasible-interior-point algorithm for linear complementarity problems
Glass cutting in a small firm
The 2013 Newton Institute Programme on polynomial optimization
Relative Pareto minimizers for multiobjective problems: existence and optimality conditions
Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
A dual approach to primal degeneracy
Rational solutions of the graphsack problem
A smooth homotopy method for incomplete markets
Friendly bin packing instances without Integer Round-up Property
Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones
Piecewise static policies for two-stage adjustable robust linear optimization
The capacitated max k -cut problem
Approximate multi-matroid intersection via iterative refinement
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
Recent progress in unconstrained nonlinear optimization without derivatives
Design of price mechanisms for network resource allocation via price of anarchy
The graph of an abstract polytope
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
On better heuristics for Steiner minimum trees
Certifying convergence of Lasserre's hierarchy via flat truncation
Optimization over convex polyhedra via Hadamard parametrizations
An RQP algorithm using a differentiable exact penalty function for inequality constrained problems
Ideal, weakly efficient solutions for vector optimization problems
A note on d-stability of convex programs and limiting Lagrangians
Inexact subgradient methods with applications in stochastic programming
Finding an interior point in the optimal face of linear programs
Existence and characterization of efficient decisions with respect to cones
On M-stationarity conditions in MPECs and the associated qualification conditions
Algorithms for highly symmetric linear and integer programs
Conditions for the discovery of solution horizons
On the symmetric travelling salesman problem II: Lifting theorems and facets
Recognizing conic TDI systems is hard
The volume algorithm revisited: relation with bundle methods
Fixed point optimization algorithm and its application to power control in CDMA data networks
Cutting planes for the multistage stochastic unit commitment problem
Multivalued convexity and optimization: A unified approach to inequality and equality constraints
Optimization of unconstrained functions with sparse Hessian matrices - Quasi-Newton methods
Multistep stochastic mirror descent for risk-averse convex stochastic programs based on extended polyhedral risk measures
Risk forms: representation, disintegration, and application to partially observable two-stage systems
Fixed-charge transportation on a path: optimization, LP formulations and separation
A new bound for the quadratic assignment problem based on convex quadratic programming
Duality for mixed-integer convex minimization
Some Proximity and Sensitivity Results in Quadratic Integer Programming
Asymptotic scheduling
Efficient first-order methods for convex minimization: a constructive approach
An interior point potential reduction method for constrained equations
A decomposition procedure based on approximate Newton directions
Asymmetric variational inequality problems over product sets: Applications and iterative methods
Examples of max-flow and min-cut problems with duality gaps in continuous networks
Idealness of k-wise intersecting families
A criterion for time aggregation in intertemporal dynamic models
The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
Improved penalty calculations for a mixed integer branch-and-bound algorithm
Proper, reflecting and absorbing facts of complementary cones
Integer programming and convex analysis: Intersection cuts from outer polars
Analysis of direct searches for discontinuous functions
Decision-making by hierarchies of discordant agents
Global minimization by reducing the duality gap
Weighted restricted 2-matching
Cone superadditivity of discrete convex functions
On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm
Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization
Polynomial root radius optimization with affine constraints
Special Issue: On the interface between optimization and probability
Local search algorithms for the rectangle packing problem with general spatial costs
A global quadratic algorithm for solving a system of mixed equalities and inequalities
Iteration-complexity of first-order penalty methods for convex programming
The traveling salesman problem on cubic and subcubic graphs
On the equivalence between strong solvability and strict semimonotonicity for some systems involving Z-functions
A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming
A semidefinite framework for trust region subproblems with applications to large scale minimization
An accelerated Newton method for equations with semismooth Jacobians and nonlinear complementarity problems
On the symmetric travelling salesman problem I: Inequalities
The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope
Resolution of the 0-1 knapsack problem: Comparison of methods
Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage
Curvilinear path steplength algorithms for minimization which use directions of negative curvature
Chordal decomposition in operator-splitting methods for sparse semidefinite programs
A block coordinate gradient descent method for regularized convex separable optimization and covariance selection
Formal optimization of some reduced linear programming problems
Mixed-integer bilevel representability
Lower subdifferentiability of quadratic functions
A nonlinear programming algorithm based on non-coercive penalty functions
Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning
Derivative-free robust optimization by outer approximations
Hyperbolicity cones are amenable
Convergence and efficiency of subgradient methods for quasiconvex minimization
Iteration-complexity of first-order augmented Lagrangian methods for convex programming
Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities
A ranking model for the greedy algorithm and discrete convexity
A cutting plane method from analytic centers for stochastic programming
Distributionally robust multi-item newsvendor problems with multimodal demand distributions
Equilibria for networks with malicious users
Distributed asynchronous computation of fixed points
A "from scratch" proof of a theorem of Rockafellar and Fulkerson
A note on Fermat's problem
Computation of all solutions to a system of polynomial equations
Martingale characterizations of risk-averse stochastic optimization problems
An implementation of the simplex method for linear programming problems with variable upper bounds
A brief history of the International Symposia on Mathematical Programming
Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
On stability in multiobjective programming - A stochastic approach
Metric regularity of epigraphical multivalued mappings and applications to vector optimization
An O(n 3 L) potential reduction algorithm for linear programming
On the stationarity for nonlinear optimization problems with polyhedral constraints
Automatic identification of embedded network rows in large-scale optimization models
Deciding uniqueness in norm maximization
Incremental proximal methods for large scale convex optimization
A quadratically convergent O(qudra root(n)*L)-iteration algorithm for linear programming
Constraint qualifications in quasidifferentiable optimization
Exact estimates of regularity modulus for infinite programming
MIP reformulations of the probabilistic set covering problem
Nonnegative forms with sublevel sets of minimal volume
A note on the complexity of L p minimization
Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
Test sets for integer programs
On Multilevel Iterative Methods for Optimization Problems
Pseudo duality in mathematical programming: Unconstrained problems and problems with equality constraints
Stable reduced Hessian updates for indefinite quadratic programming
Relations between facets of low- and high-dimensional group problems
Foreword: special issue on robust optimization
New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs
Polynomial affine algorithms for linear programming
Intersecting and dense restrictions of clutters in polynomial time
A tight $\sqrt{2}$-approximation for linear 3-cut
A globally convergent primal-dual interior-point filter method for nonlinear programming
Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
Penalty methods for computing points that satisfy second order necessary conditions
Outer-product-free sets for polynomial optimization and oracle-based cuts
An SQP method for general nonlinear programs using only equality constrained subproblems
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets
On the geometry of symmetry breaking inequalities
Finding global minima via kernel approximations
Duality and statistical tests of optimality for two stage stochastic programs
Almost all webs are not rank-perfect
k-Trails: recognition, complexity, and approximations
Fixed point theorems for discontinuous mapping
Recognition problems for special classes of polynomials in 0-1 variables
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
Accumulating Jacobians as chained sparse matrix products
On the average speed of Lemke's algorithm for quadratic programming
Lifting and separation procedures for the cut polytope
A simple method for convex optimization in the oracle model
Mixed-integer optimal control under minimum dwell time constraints
Generating facets for the cut polytope of a graph by triangular elimination
Linear regression with partially mismatched data: local search with theoretical guarantees
The theorem of the alternative, the key-theorem, and the vector-maximum problem
A discrete Newton algorithm for minimizing a function of many variables
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
A polyhedral study of nonconvex quadratic programs with box constraints
A nearly optimal randomized algorithm for explorable heap selection
Covering symmetric supermodular functions by graphs
Quasi balanced matrices - An addendum
Approximations and solution estimates in optimization
Tractable approximations of sets defined with quantifiers
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
Maximum network flows with concave gains
Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints
Newton acceleration on manifolds identified by proximal gradient methods
Sublevel representations of epi-Lipschitz sets and other properties
A new subdivision for computing fixed points with a homotopy algorithm
Existence of optimal solutions and duality results under weak conditions
On the superlinear local convergence of a filter-SQP method
Long steps in an O(n 3 L) algorithm for linear programming
Binary decision rules for multistage adaptive mixed-integer optimization
Tangential extremal principles for finite and infinite systems of sets, I: basic theory
Directional derivative estimates for the optimal value function of a quasidifferentiable programming problem
Sparse noncommutative polynomial optimization
Quadratic reformulations of nonlinear binary optimization problems
The value function of an integer program
Optimization with an approximate Lagrangian
Numerically stable methods for quadratic programming
Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
Split closure and intersection cuts
A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
A note on quasi-newton formulae for sparse second derivative matrices
The Fermat-Weber location problem revisited
Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
On the Douglas-Rachford algorithm
Approximating the discrete time-cost tradeoff problem with bounded depth
On the separation of split cuts and related inequalities
A successive quadratic programming algorithm with global and superlinear convergence properties
The application of optimal control methodology to nonlinear programming problems
Sufficient matrices belong to L
A note on the necessary conditions for exact aggregation of linear programming models
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
On the core and nucleolus of directed acyclic graph games
Linearization of mixed-integer products
An abstract model for branch and cut
Linear complementarity problems with an invariant number of solutions
Typical convex program is very well posed
Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems
On piecewise quadratic Newton and trust region problems
The least element property of center location on tree networks with applications to distance and precedence constrained problems
On the tightness of SDP relaxations of QCQPs
A variable dimension algorithm for the linear complementarity problem
First-order methods almost always avoid strict saddle points
Newton's Method for the Nonlinear Complementarity Problem: A B-Differentiable Equation Approach
A stochastic method for global optimization
A network penalty method
Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
Matrix Scaling, Entropy Minimization, and Conjugate Duality (II): The Dual Problem
Dijkstra's algorithm and L-concave function maximization
Distributed stochastic gradient tracking methods
Polynomiality of infeasible-interior-point algorithms for linear programming
An inexact primal-dual path following algorithm for convex quadratic SDP
Probably certifiably correct k-means clustering
A complementary variant of Lemke's method for the linear complementary problem
Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems
Integral decomposition in polyhedra
Exact algorithms for the chance-constrained vehicle routing problem
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization