yusuke1997/dblp-id-title huggingface dataset:
Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions
Implementing bounds-based approximations in convex-concave two-stage stochastic programming
A Stochastic Successive Minimization Method for Nonsmooth Nonconvex Optimization with Applications to Transceiver Design in Wireless Communication Networks
Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
Continuous optimization methods for structure alignments
Lower bounds on the sizes of integer programs without additional variables
Optimal item pricing in online combinatorial auctions
Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity
Barycentric scenario trees in convex multistage stochastic programming
Gomory integer programs
An algorithm for nonsmooth optimization by successive piecewise linearization
Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem
On compact representations of Voronoi cells of lattices
A primal-dual extension of the Goemans-Williamson algorithm for the weighted fractional cut-covering problem
Scaling, proximity, and optimization of integrally convex functions
An integer programming approach to a class of combinatorial problems
Lifting properties of maximal lattice-free polyhedra
A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming
Lipschitzian Q-matrices are P-matrices
An infeasible (exterior point) simplex algorithm for assignment problems
Set regularities and feasibility problems
On the stable solution of large scale problems over the doubly nonnegative cone
Local convergence of tensor methods
Publisher Correction to: Lyapunov stability of the subgradient method with constant step size
A structure-preserving pivotal method for affine variational inequalities
Differentiability with respect to parameters of solutions to convex programming problems
Wedge trust region methods for derivative free optimization
Globally convergent conjugate gradient algorithms
Integrality gaps for strengthened linear relaxations of capacitated facility location
On the geometric rank of matching polytope
Optimal design of a manpower system
Directed vertex-connectivity augmentation
Optimal sharing
Approximations of Nash equilibria
Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
The adjacency relation on the traveling salesman polytope is NP-Complete
Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem
On variance reduction for stochastic smooth convex optimization with multiplicative noise
Lifting the facets of zero-one polytopes
Integer programming
A note on the implementation of an interior-point algorithm for nonlinear optimization with inexact step computations
Efficient computation of a canonical form for a matrix with the generalized P-property
Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data
On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
A note on a theorem of F. Browder
Variational analysis of non-Lipschitz spectral functions
Simple and fast algorithm for binary integer and online linear programming
Optimal flows in networks with multiple sources and sinks
Characterization of stable matchings as extreme points of a polytope
An algebraic approach to assignment problems
Combined lp and quasi-Newton methods for minimax optimization
The vertex separator problem: a polyhedral investigation
An active-set strategy in an interior point method for linear programming
A 3/2-approximation algorithm for some minimum-cost graph problems
Attraction of Newton method to critical Lagrange multipliers: fully quadratic case
The octahedral algorithm, a new simplicial fixed point algorithm
Robust convex quadratically constrained programs
Acceleration by stepsize hedging: Silver Stepsize Schedule for smooth convex optimization
Approximating the independence number via the theta-function
A closed-form representation of mixed-integer program value functions
Minimizing finite sums with the stochastic average gradient
A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results
Risk-neutral PDE-constrained generalized Nash equilibrium problems
On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
Quantitative stability in stochastic programming
On the big Mu in the affine scaling algorithm
Choquet representability of submodular functions
A recursive quadratic programming algorithm that uses differentiable exact penalty functions
A bundle type approach to the unconstrained minimization of convex nonsmooth functions
A symmetrical linear maxmin approach to disjoint bilinear programming
A first order, exact penalty function algorithm for equality constrained optimization problems
Generalized self-concordant functions: a recipe for Newton-type methods
A bundle-Newton method for nonsmooth unconstrained minimization
Bootstrap robust prescriptive analytics
Extended formulations from communication protocols in output-efficient time
bc - opt : a branch-and-cut code for mixed integer programs
Optimization problems involving group sparsity terms
On decomposability of Multilinear sets
Worst-case complexity of cyclic coordinate descent: O(n 2) gap with randomized version
Nested decomposition of multistage nonlinear programs with recourse
Nonlinear programming: theory and practice
Near-optimal discrete optimization for experimental design: a regret minimization approach
Distribution functions in stochastic programs with recourse: A parametric analysis
Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank
Structural iterative rounding for generalized k-median problems
On solving optimization problems with proportion-constraints
Concepts of optimality and their uses - Nobel Memorial Lecture - 11 December 1975
On the convergence of the iteration sequence in primal-dual interior-point methods
A dual decomposition algorithm
Randomized pivot algorithms for P-matrix linear complementarity problems
Complexity of unconstrained $$L_2-L_p$$ minimization
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
Cycling in linear complementarity problems
Hybrid programs: Linear and least-distance
The application of Mathematical Programming methods to oil and gas field development planning
Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
Statistical ranking and combinatorial Hodge theory
Better s-t-tours by Gao trees
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Testing for complete efficiency in a vector maximization problem
Accelerating variance-reduced stochastic gradient methods
Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
A $\frac{4}{3}$-approximation algorithm for half-integral cycle cut instances of the TSP
A nonsmooth Robinson's inverse function theorem in Banach spaces
Complexity analysis of the analytic center cutting plane method that uses multiple cuts
Stronger bounds and faster algorithms for packing in generalized kernel systems
Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
The Principal Pivoting Method Revisited
A continuation method for monotone variational inequalities
Robust smoothed analysis of a condition number for linear programming
Tree polytope on 2-trees
Hyperbolic polynomials, interlacers, and sums of squares
Characterizing quasiconvexity of the pointwise infimum of a family of arbitrary translations of quasiconvex functions, with applications to sums and quasiconvex optimization
Convergence of interval-type algorithms for generalized fractional programming
Matching, matroids, and extensions
Bundle methods for sum-functions with "easy" components: applications to multicommodity network design
Computation and efficiency of potential function minimizers of combinatorial congestion games
Partitioning a graph into small pieces with applications to path transversal
The maximum measure of non-trivial 3-wise intersecting families
Integral simplex using decomposition with primal cutting planes
The augmented Lagrangian method can approximately solve convex optimization with least constraint violation
Generalized equations and the generalized Newton method
A dual-active-set algorithm for positive semi-definite quadratic programming
An algorithm for computing equilibria in a linear monetary economy
On proving existence of feasible points in equality constrained optimization problems
Convex infinite horizon programs
Convergence of a relaxed inertial proximal algorithm for maximally monotone operators
Some convex programs without a duality gap
Scenario tree modeling for multistage stochastic programs
On "an efficient algorithm for minimizing barrier and penalty functions"
A competitive algorithm for throughput maximization on identical machines
The complexity of recognizing linear systems with certain integrality properties
A dynamic inequality generation scheme for polynomial programming
Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
A globally convergent proximal Newton-type method in nonsmooth convex optimization
Discrete optimization in public rail transport
The simplest examples where the simplex method cycles and conditions where expand fails to prevent cycling
A fixed point theorem including the last theorem of Poincaré
An exact penalty function for semi-infinite programming
An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
On combining feasibility, descent and superlinear convergence in inequality constrained optimization
Multiobjective optimization problem with variational inequality constraints
Some experiments with the pathological linear programs of N. Zadeh
The D 2 -triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
Cut generation through binarization
A nonsmooth Newton method for variational inequalities, I: theory
Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses
Bilinear programming: An exact algorithm
On consistency of stochastic dominance and mean-semideviation models
An update-and-stabilize framework for the minimum-norm-point problem
On the existence of solutions to stochastic quasi-variational inequality and complementarity problems
A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point
Partition polytopes over 1-dimensional points
Semidefinite and linear programming integrality gaps for scheduling identical machines
A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
A constant-factor approximation for generalized malleable scheduling under $M ^{\natural }$-concave processing speeds
A method of linearizations for linearly constrained nonconvex nonsmooth minimization
Strongly polynomial dual simplex methods for the maximum flow problem
Determination of optimal vertices from feasible solutions in unimodular linear programming
Average case polyhedral complexity of the maximum stable set problem
Large Scale Nonlinear Deterministic and Stochastic Optimization: Formulations Involving Simulation of Subsurface Contamination
Mixed-integer quadratic programming is in NP
A globally convergent primal-dual interior point algorithm for convex programming
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
Linear programming, the simplex algorithm and simple polytopes
On the Fermat - Weber problem with convex cost functions
Change of generalized indices of stationary solutions. to multiparametric optimization
Measure concentration in optimization
On capacitated network design cut-set polyhedra
On min-norm and min-max methods of multi-objective optimization
A polynomial method of approximate centers for linear programming
Characterization of strong stability for C-stationary points in MPCC
A primal projective interior point method for linear programming
Generalized monotone operators and their averaged resolvents
Convex risk measures for portfolio optimization and concepts of flexibility
An interior algorithm for nonlinear optimization that combines line search and trust region steps
A condensation method for generalized geometric programming
Data-driven estimation in equilibrium using inverse optimization
Optimizing constrained subtrees of trees
Smoothing Technique and its Applications in Semidefinite Optimization
On some dynamic thermal non clamped contact problems
Local and superlinear convergence for truncated iterated projections methods
Stochastic on-line knapsack problems
Global s -type error bound for the extended linear complementarity problem and applications
Correction to: Equilibrium computation in resource allocation games
Fenchel-type duality for matroid valuations
The cutting stock problem and integer rounding
Optimizing over path-length matrices of unrooted binary trees
A node-capacitated Okamura-Seymour theorem
Convex analysis can be helpful for the asymptotic analysis of monotone operators
Some properties of nondifferentiable pseudoconvex functions
Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming
On the block-structured distance to non-surjectivity of sublinear mappings
Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
Consistent approximations in composite optimization
An assessment of two approaches to variable metric methods
Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization
Sum-of-squares hierarchies for binary polynomial optimization
An inexact dual logarithmic barrier method for solving sparse semidefinite programs
An additive bounding procedure for the asymmetric travelling salesman problem
The polyhedral geometry of truthful auctions
Worst-case results for positive semidefinite rank
A mathematician's journey through operational research
Demand allocation with latency cost functions
A Riemannian symmetric rank-one trust-region method
Economic planning with institutional price constraints for a decentralized economy
{0, 1/2}-Chvátal-Gomory cuts
A convex-analysis perspective on disjunctive cuts
New crash procedures for large systems of linear constraints
Sensitivity analysis for nonlinear programming using penalty methods
Sparse learning via Boolean relaxations
Sample-path optimization of convex stochastic performance functions
The packing property
Nonlinear chance-constrained problems with applications to hydro scheduling
A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
Nonlinear acceleration of momentum and primal-dual algorithms
A dual approach to solving nonlinear programming problems by unconstrained optimization
Nonlinear programming via an exact penalty function: Asymptotic analysis
The complexity of an l p method for discrete Tchebycheff approximation in exact arithmetic
On blind source separation using mutual information criterion
Packing and covering with integral feasible flows in integral supply-demand networks
Convergence of an annealing algorithm
On circuit diameter bounds via circuit imbalances
Noisy tensor completion via the sum-of-squares hierarchy
Stabilization of capacitated matching games
Analysis of nonsmooth vector-valued functions associated with second-order cones
On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy
Self-concordant barriers for hyperbolic means
Graph cuts with interacting edge weights: examples, approximations, and algorithms
Practical convergence conditions for unconstrained optimization
Stability under perturbations of some condition numbers in optimization
Variable metric random pursuit
Radial duality part II: applications and algorithms
Lagrangean decomposition: A model yielding stronger lagrangean bounds
Geometric random edge
Tensor methods for large sparse systems of nonlinear equations
Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
Solving linear programs from sign patterns
Negative-cycle detection algorithms
On the Convergence of Cross Decomposition
About a minimax theorem of Matthies, Strang and Christiansen
The two-dimensional cutting stock problem revisited
Sparsity in sums of squares of polynomials
Improved local convergence results for augmented Lagrangian methods in $${\varvec{C}}^\mathbf{2}$$ C 2 -cone reducible constrained optimization
Towards variational analysis in metric spaces: metric regularity and fixed points
Correction to: Complexity of stochastic dual dynamic programming
Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization
A simple constraint qualification in convex programming
Multi-marginal maximal monotonicity and convex analysis
On the cut polytope
An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
On the connectedness of the set of almost complementary paths of a linear complementarity problem
Weak k-majorization and polyhedra
On the convergence of the method of analytic centers when applied to convex quadratic programs
A note on packing paths in planar graphs
On pseudo-convex functions of nonnegative variables
A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function
Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
A general framework for multi-marginal optimal transport
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
Fast convergence of the simplified largest step path following algorithm
On totally Fenchel unstable functions in finite dimensional spaces
Quadratic growth and critical point stability of semi-algebraic functions
Beyond symmetric Broyden for updating quadratic models in minimization without derivatives
An improved approximation ratio for the minimum latency problem
Applications of the method of partial inverses to convex programming: Decomposition
The diameters of network-flow polytopes satisfy the Hirsch conjecture
On rank-monotone graph operations and minimal obstruction graphs for the Lovász-Schrijver SDP hierarchy
An MPEC approach to second-best toll pricing
Strong formulations for conic quadratic optimization with indicator variables
Principal component analysis combined with truncated-Newton minimization for dimensionality reduction of chemical databases
Node connectivity augmentation via iterative randomized rounding
Computing the nucleolus of some combinatorially-structured games
The mixed general routing polyhedron
Duality in convex stochastic optimization
ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
A unified approach for minimizing composite norms
A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
Quadratic programs with hollows
Vertex-Disjoint Packing of Two Steiner Trees: polyhedra and branch-and-cut
Empowering the configuration-IP: new PTAS results for scheduling with setup times
Pseudolinearity and efficiency
Conditional gradient type methods for composite nonlinear and stochastic optimization
Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation
Computational study of large-scale p -Median problems
Solving variational inequality and fixed point problems by line searches and potential optimization
On pairs of vectors achieving the maximal angle of a convex cone
Subdifferentials at infinity and applications in optimization
Certifiably optimal sparse inverse covariance estimation
A revised simplex method for linear multiple objective programs
A note on the Undirected Rural Postman Problem polytope
Scheduling activities among conflicting facilities to minimize conflict cost
On the mixing set with a knapsack constraint
A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization
Constraint aggregation principle in convex optimization
High-multiplicity N-fold IP via configuration LP
Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems
On the computational behavior of a polynomial-time network flow algorithm
Behavior of accelerated gradient methods near critical points of nonconvex functions
A note on an open problem in linear complementarity
Basis- and partition identification for quadratic programming and linear complementarity problems
The stable admissions polytope
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
SAA-regularized methods for multiproduct price optimization under the pure characteristics demand model
A globally convergent Newton method for solving strongly monotone variational inequalities
Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
Parallel coordinate descent methods for big data optimization
Nonlinear distributionally robust optimization
Lower bounds for finding stationary points II: first-order methods
Optimal complexity and certification of Bregman first-order methods
Stochastic algorithms with geometric step decay converge linearly on sharp functions
Characterizing consistency in probabilistic logic for a class of Horn clauses
The expected number of extreme points of a random linear program
The Collapsing 0-1 Knapsack Problem
"Cone-free" primal-dual path-following and potential-reduction polynomial time interior-point methods
Neighborhood persistency of the linear optimization relaxation of integer linear optimization
Foreword: Special issue on large-scale nonlinear and semidefinite programming
Partitioning mathematical programs for parallel solution
Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
A polynomial projection algorithm for linear feasibility problems
A class of polynomially solvable linear complementarity problems
Constructing lattice-free gradient polyhedra in dimension two
DC programming and DCA: thirty years of developments
Cyclical games with prohibitions
Optimal gradient tracking for decentralized optimization
Fully dynamic bin packing revisited
Decreasing minimization on M-convex sets: background and structures
Some perturbation results for the Linear Complementarity Problem
Moment inequalities for sums of random matrices and their applications in optimization
A subproblem-centric model and approach to the nurse scheduling problem
Iterative methods for linear complementarity problems with upperbounds on primary variables
Continuous optimization: 5th Brazilian workshop
An asymptotically exact algorithm for the high-multiplicity bin packing problem
Decomposition of probability marginals for security games in max-flow/min-cut systems
Algebraic Optimization: The Fermat-Weber Location Problem
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
Inverse stochastic dominance constraints and rank dependent expected utility theory
Smoothed performance guarantees for local search
On the symmetry function of a convex set
A new arc algorithm for unconstrained optimization
Polyhedra related to a lattice
A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
An improvement of fixed point algorithms by using a good triangulation
Minimal concave cost rebalance of a portfolio to the efficient frontier