yusuke1997/dblp-id-title huggingface dataset:
Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices
Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
Tensor principal component analysis via convex optimization
Submodular functions: from discrete to continuous domains
Tractable stochastic analysis in high dimensions via robust optimization
On using equality-constraint algorithms for inequality constrained problems
On splittable and unsplittable flow capacitated network design arc-set polyhedra
On the solution of a two ball trust region subproblem
Lower bounds on the size of general branch-and-bound trees
Lagrange multipliers, (exact) regularization and error bounds for monotone variational inequalities
Polyhedral properties for the intersection of two knapsacks
Determination of convex functions via subgradients of minimal norm
A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization
Logarithmic SUMT limits in convex programming
Supermodularity and valid inequalities for quadratic optimization with indicators
Approximate and strategyproof maximin share allocation of chores with ordinal preferences
A polynomial-time algorithm for computing the yolk in fixed dimension
Dual gauge programs, with applications to quadratic programming and the minimum-norm problem
Optimal conditioning in the convex class of rank two updates
A restricted Lagrangean approach to the traveling salesman problem
Improved strategies for branching on general disjunctions
Extended neighborhood: Definition and characterization
Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications
Swarm gradient dynamics for global optimization: the mean-field limit case
A polynomial algorithm for the max-cut problem on graphs without long odd cycles
Multiplicative auction algorithm for approximate maximum weight bipartite matching
Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
First order asymptotics of the sample average approximation method to solve risk averse stochastic programs
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation
A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
Approximation of linear fractional-multiplicative problems
A polyhedron with all s - t cuts as vertices, and adjacency of cuts
An analysis of reduced Hessian methods for constrained optimization
On the maximal number of columns of a Δ-modular integer matrix: bounds and computations
Hydroelectric reservoir optimization in a pool market
Chebyshev center of the intersection of balls: complexity, relaxation and approximation
Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints
An FPTAS for minimizing the product of two non-negative linear cost functions
On Q-matrices
Blocking optimal arborescences
Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization
Solving large quadratic assignment problems on computational grids
Set characterizations and convex extensions for geometric convex-hull proofs
Adjustability in robust linear optimization
Degeneracy in fixed cost transportation problems
Fixed-charge continuous knapsack problems and pseudogreedy solutions
Linear complementarity problems solvable by A single linear program
On Large Scale Nonlinear Network Optimization
Verifiable sufficient conditions for the error bound property of second-order cone complementarity problems
A new algorithm for solving variational inequalities with application to the traffic assignment problem
An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones
A duality based 2-approximation algorithm for maximum agreement forest
Combining search directions using gradient flows
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
Conditional gradient algorithms for norm-regularized smooth convex optimization
On the cost of solving augmented Lagrangian subproblems
Semidefinite programming hierarchies for constrained bilinear optimization
Experimental results on Hillier's linear search
On a characterization of convexity-preserving maps, Davidon's collinear scalings and Karmarkar's projective transformations
Computing mountain passes and transition states
An O(s r) -resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems
An approximation scheme for a class of risk-averse stochastic equilibrium problems
Convex proximal bundle methods in depth: a unified analysis for inexact oracles
On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
Differential variational inequality approach to dynamic games with shared constraints
Minimizing buffered probability of exceedance by progressive hedging
The strong conical hull intersection property for convex programming
Easy and difficult objective functions for max cut
On the average length of lexicographic paths
Augmented non-quadratic penalty algorithms
On greedy algorithms for series parallel graphs
Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
Conjugacy relationship between M-convex and L-convex functions in continuous variables
Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
Generalized semi-infinite optimization: A first order optimality condition and examples
Contingent derivatives of set-valued maps and applications to vector optimization
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2023
On the convergence rate of Douglas-Rachford operator splitting method
Robust resource allocations in temporal networks
A qualitative mathematical analysis of a class of linear variational inequalities via semi-complementarity problems: applications in electronics
A note on the selection of Benders' cuts
Facets of the independent set polytope
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
A note on locally Lipschitzian functions
Regular (2, 2)-systems
Higher-order reverse automatic differentiation with emphasis on the third-order
A theoretical and computational analysis of full strong-branching
A Farkas lemma for difference sublinear systems and quasidifferentiable programming
Cartesian P -property and Its Applications to the Semidefinite Linear Complementarity Problem
Directional differentiability of optimal solutions under Slater's condition
Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization
Least distance methods for the scheme of polytopes
On the use of directions of negative curvature in a modified newton method
Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization
Approval-based apportionment
Diverse collections in matroids and graphs
Subdifferential characterization of probability functions under Gaussian distribution
First-order algorithm with 𝒪(ln(1/ε)) convergence for ε-equilibrium in two-person zero-sum games
A geometric programming approach to the Van der Waerden conjecture on doubly stochastic matrices
A smoothing-out technique for min - max optimization
Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
Some remarks on condensation methods for geometric programs
Generalized theorems for permanent basic and nonbasic variables
Optimal control of molecular dynamics using Markov state models
Upper bounds for Gaussian stochastic programs
Comments on the general duality survey by J. Tind and L.A. Wolsey
The basic theorem of complementarity revisited
Parallel Newton methods for the nonlinear complementarity problem
Break minimization
Optimization of pipe networks
Hesitant adaptive search for global optimisation
Matrix augmentation and structure preservation in linearly constrained control problems
Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
An approximation technique for robust nonlinear optimization
Consistent learning by composite proximal thresholding
A model of the coNP-complete non-Hamilton tour decision problem for directed graphs
Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis
Nonlinear programming and stationary equilibria in stochastic games
Generalized Nash equilibrium problems with mixed-integer variables
Solving matching problems with linear programming
A D {\mathsf{D}}-induced duality and its applications
Quadratic diameter bounds for dual network flow polyhedra
Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
Robust game theory
Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
Constrained definite Hessians tend to be well conditioned
New approaches to multi-objective optimization
Geometry of interpolation sets in derivative free optimization
On optimizing functions which are defined in part by an approximation process
Tight relaxations for polynomial optimization and Lagrange multiplier expressions
A probabilistic analysis of the switching algorithm for the euclidean TSP
Termination and equivalence results for conjugate gradient algorithms
On the complexity of four polyhedral set containment problems
Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
On the solution of highly degenerate linear programmes
Computational complexity of parametric linear programming
Restricted simplicial decomposition for convex constrained problems
Characterization of Filippov representable maps and Clarke subdifferentials
On the existence of 0/1 polytopes with high semidefinite extension complexity
Some facets of the simple plant location polytope
A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with -iteration complexity
Decomposition of arrow type positive semidefinite matrices with application to topology optimization
Varying confidence levels for CVaR risk measures and minimax limits
Exact and approximation algorithms for weighted matroid intersection
On mixing sets arising in chance-constrained programming
Bounds for the quadratic assignment problem using the bundle method
Crashing a maximum-weight complementary basis
Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity
Parallel application of block-iterative methods in medical imaging and radiation therapy
Comparative computer results of a new complementary pivot algorithm for solving equality and inequality constrained optimization problems
On the effective Putinar's Positivstellensatz and moment approximation
Polynomial dual network simplex algorithms
Links between directional derivatives through multidirectional mean value inequalities
A globally and quadratically convergent affine scaling method for linear l 1 problems
Special Issue: International Symposium on Mathematical Programming, Bordeaux, July 2018
Abnormal equality-constrained optimization problems: sensitivity theory
Interior path following primal-dual algorithms. part II: Convex quadratic programming
Passivity and complementarity
A general saddle point result for constrained optimization
Iterative reweighted minimization methods for l p regularized unconstrained nonlinear programming
On linear optimization over Wasserstein balls
Dimension reduction for semidefinite programs via Jordan algebras
Complexity of optimizing over the integers
First- and second-order methods for semidefinite programming
Base polytopes of series-parallel posets: Linear description and optimization
Minimum concave cost production system: A further generalization of multi-echelon model
Sparse solutions to random standard quadratic optimization problems
Worst-case distribution analysis of stochastic programs
The decomposition of nonlinear problems
Efficient cost-sharing mechanisms for prize-collecting problems
Competitive Multi-period Pricing for Perishable Products: A Robust Optimization Approach
Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
Vertical linear complementarity and discounted zero-sum stochastic games with ARAT structure
Robust Mean-Squared Error Estimation of Multiple Signals in Linear Systems Affected by Model and Noise Uncertainties
Dynamic graph generation for the shortest path problem in time expanded networks
On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
Computing the nucleolus of weighted voting games in pseudo-polynomial time
S-lemma with equality and its applications
A new algorithm for minimizing convex functions over convex sets
On the differential properties of the support function of the ∈-subdifferential of a convex function
Approximation algorithms for the test cover problem
A spectral bundle method with bounds
Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
Truthful ownership transfer with expert advice
A fast algorithm for computing minimum 3-way and 4-way cuts
A primal-dual infeasible-interior-point algorithm for linear programming
Machine scheduling with resource dependent processing times
Extended formulations for the A-cut problem
Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
Solving multistage stochastic network programs on massively parallel computers
The bisection method in higher dimensions
On imposing connectivity constraints in integer programs
Combinatorial interior point methods for generalized network flow problems
The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P -functions
The clustering matroid and the optimal clustering tree
An exact penalty approach for optimization with nonnegative orthogonality constraints
A note on the Lipschitz continuity of the gradient of the squared norm of the matrix-valued Fischer-Burmeister function
New results on equivalent integer programming formulations
Maximum skew-symmetric flows and matchings
A new graph parameter related to bounded rank positive semidefinite matrix completions
An existence theorem for solutions to f(x) = 0
Global optimization of nonconvex factorable programming problems
Bilevel programming for generating discrete representations in multiobjective optimization
Exploring relaxation induced neighborhoods to improve MIP solutions
On the partial order polytope of a digraph
Primal-dual schema for capacitated covering problems
Conic version of Loewner-John ellipsoid theorem
Inexact implicit methods for monotone general variational inequalities
Strong formulations for mixed integer programs: valid inequalities and extended formulations
A continuation method for (strongly) monotone variational inequalities
Structure of the first-order solution set for a class of nonlinear programs with parameters
Nonlinear programming methods in the presence of noise
Strong Formulations of Robust Mixed 0-1 Programming
Max algebra and the linear assignment problem
Updated triangular factors of the basis to maintain sparsity in the product form simplex method
The largest step path following algorithm for monotone linear complementarity problems
Accelerated convergence for the Powell/Hestenes multiplier method
Asynchronous level bundle methods
Minimum concave cost flow over a grid network
Distribution sensitivity analysis for stochastic programs with complete recourse
On the foundations of linear and integer linear programming I
Solution techniques for some allocation problems
Security games on matroids
Superlinear convergence of Broyden's bounded θ-class of methods
Two commodity network flows and linear programming
Optimal objective function approximation for separable convex quadratic programming
A new algorithm for generalized fractional programs
D.c. sets, d.c. functions and nonlinear equations
On sensitivity of central solutions in semidefinite programming
A cellation of the Grassmann manifold
Connecting optimization with spectral analysis of tri-diagonal matrices
On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling
A note on sensitivity of value functions of mathematical programs with complementarity constraints
Matroid bases with cardinality constraints on the intersection
Improved integer programming bounds using intersections of corner polyhedra
Multi-phase dynamic constraint aggregation for set partitioning type problems
Linear complementarity problems and multiple objective programming
Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
A new pivot selection rule for the network simplex algorithm
Analytical properties of the central path at boundary point in linear programming
Graph isomorphism: physical resources, optimization models, and algebraic characterizations
Characterization of the smoothness and curvature of a marginal function for a trust-region problem
An efficient approach to updating simplex multipliers in the simplex algorithm
A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
New variants of bundle methods
Robust discrete optimization and network flows
Robust optimization approach for a chance-constrained binary knapsack problem
On supervalid inequalities for binary interdiction games
Vector coloring the categorical product of graphs
Another note on bimatrix games
Random sampling and greedy sparsification for matroid optimization problems
Numerical block diagonalization of matrix *-algebras with application to semidefinite programming
On computing the center of a convex quadratically constrained set
Revisions of constraint approximations in the successive QP method for nonlinear programming problems
The computational complexity of finding stationary points in non-convex optimization
A Lagrangian-based heuristic for large-scale set covering problems
Decomposition in general mathematical programming
Directional derivatives of the solution of a parametric nonlinear program
Clarification of certain (α, β)-polarity results of Bachem and Grötschel
Hierarchical decomposition of symmetric discrete systems by matroid and group theories
Optimal sampled-data controls with running inequality state constraints: Pontryagin maximum principle and bouncing trajectory phenomenon
Convergence of a simple subgradient level method
Max-norm optimization for robust matrix recovery
On semidefinite programming relaxations of maximum $$k$$ -section
Bi-objective multistage stochastic linear programming
Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates
Computing approximate solutions for convex conic systems of constraints
Approximate k -MSTs and k -Steiner trees via the primal-dual method and Lagrangean relaxation
First and second order conditions for a class of nondifferentiable optimization problems
A simplex-type algorithm for continuous linear programs with constant coefficients
Short-step methods are not strongly polynomial-time
Vector maximization at a degenerate vertex
An implementation of an algorithm for univariate minimization and an application to nested optimization
The core of a transferable utility game as the solution to a public good market demand problem
On the directional asymptotic approach in optimization theory
New classes of fast lower bounds for bin packing problems
Gradient sliding for composite optimization
A Projection Method for the Uncapacitated Facility Location Problem
A linear programming approach to solving bilinear programmes
Distance majorization and its applications
Some recent results in n -person game theory
Reporting computational experiments in mathematical programming
Strong inequalities for capacitated survivable network design problems
Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
Convergence of inexact Newton methods for generalized equations
The role of linear objective functions in barrier methods
Integrated simulation and optimization models for tracking international fixed income indices
Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
Computational study of a column generation algorithm for bin packing and cutting stock problems
Processing second-order stochastic dominance models using cutting-plane representations
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
Polyhedral results for two-connected networks with bounded rings
Generating conjugate directions without line searches using factorized variable metric updating formulas
A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
Truncated-newtono algorithms for large-scale unconstrained optimization
On the convexity of the multiplicative version of Karmarkar's potential function
Stochastic optimization using a trust-region method and random models
Call for papers: Symposium on Mathematical Programming with Data Perturbations - May 24-25, 1979 at The George Washington University, Washington, DC, U.S.A
A nonlinear equation for linear programming
On t-branch split cuts for mixed-integer programs
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Sobolev seminorm of quadratic functions with applications to derivative-free optimization
A unified framework for symmetry handling
Introduction to convex optimization in financial markets
Stackelberg pricing games with congestion effects
A modified secant method for unconstrained minimization
A linear time algorithm for linearizing quadratic and higher-order shortest path problems
Minimum cost capacity installation for multicommodity network flows
Concavity cuts for disjoint bilinear programming
Correction: Regular packing of rooted hyperforests with root constraints in hypergraphs
Box-total dual integrality and edge-connectivity
Generalized minimum 0-extension problem and discrete convexity
Stability in the presence of degeneracy and error estimation
Epsilon-proximal decomposition method
Estimation of an optimal solution of a LP problem with unknown objective function
A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start"
Roof duality for polynomial 0-1 optimization
Nuclear norm minimization for the planted clique and biclique problems
On a semi-smooth Newton method and its globalization
A smoothing SQP framework for a class of composite L q minimization over polyhedron
Box-inequalities for quadratic assignment polytopes
Lift-and-project cuts and perfect graphs
Quadratic two-stage stochastic optimization with coherent measures of risk
A class of gap functions for variational inequalities
Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
Traveling salesman games
Valid inequalities and facets of the capacitated plant location problem
Properties of the Moreau-Yosida regularization of a piecewise C 2 convex function
Convergence of the cyclical relaxation method for linear inequalities
The precedence-constrained asymmetric traveling salesman polytope
The reformulation of two mixed integer programming problems
Hidden convexity in some nonconvex quadratically constrained quadratic programming
Cost operator algorithms for the transportation problem
Segments in enumerating faces
Coercivity conditions and variational inequalities
On the local convergence of adjoint Broyden methods
Second-order cone programming
Proximity in concave integer quadratic programming
A note on the existence of subgradients
On trust region methods for unconstrained minimization without derivatives