Complexity and algorithms for nonlinear optimization problems
From MaRDI portal
Publication:2480263
DOI10.1007/S10479-007-0172-6zbMATH Open1159.90485OpenAlexW2051716090MaRDI QIDQ2480263FDOQ2480263
Authors: Dorit S. Hochbaum 
Publication date: 31 March 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0172-6
Recommendations
- Complexity and algorithms for convex network optimization and other nonlinear problems
- Publication:4864690
- scientific article; zbMATH DE number 757674
- Convex separable optimization is not much harder than linear optimization
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A theorem on flows in networks
- Fast Approximation Algorithms for Knapsack Problems
- Minimizing a Convex Cost Closure Set
- Some proximity and sensitivity results in quadratic integer programming
- A new approach to the maximum-flow problem
- A Fast Parametric Maximum Flow Algorithm and Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Lower Bounds for Computations with the Floor Operation
- Parametric flows, weighted means of cuts, and fractional combinatorial optimization
- A strongly polynomial minimum cost circulation algorithm
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- Time bounds for selection
- Inverse Optimization
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- Computationally Related Problems
- On an instance of the inverse shortest paths problem
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Linear time algorithms for some separable quadratic programming problems
- An O(n) algorithm for quadratic knapsack problems
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- A solvable case of quadratic 0-1 programming
- The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
- Convex separable optimization is not much harder than linear optimization
- Solving the convex cost integer dual network flow problem
- A polynomial algorithm for minimum quadratic cost flow problems
- Unimodular functions
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- On the Complexity of the Production-Transportation Problem
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
- Network Optimization Problems: Algorithms, Applications and Complexity
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
- Solving integer minimum cost flows with separable convex cost objective polynomially
- A nonlinear knapsack problem
- A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
- Matrix scaling by network flow
- A parametric algorithm for convex cost network flow and related problems
- Complexity and algorithms for convex network optimization and other nonlinear problems
- An efficient algorithm for image segmentation, Markov random fields and related problems
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
- Title not available (Why is that?)
- Optimal Flows in Networks with Multiple Sources and Sinks, with Applications to Oil and Gas Lease Investment Programs
- The empirical performance of a polynomial algorithm for constrained nonlinear optimization
- Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
- On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem
Cited In (35)
- A polynomial-time descent method for separable convex optimization problems with linear constraints
- Optimization algorithms for a class of nonlinear programming problems
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
- Complexity of a class of nonlinear combinatorial problems related to their linear counterparts
- The complexity of optimization problems
- Convex separable optimization is not much harder than linear optimization
- Scaling, proximity, and optimization of integrally convex functions
- Complexity, exactness, and rationality in polynomial optimization
- Complexity, exactness, and rationality in polynomial optimization
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- A faster algorithm solving a generalization of isotonic median regression and a class of fused Lasso problems
- Discrete midpoint convexity
- Selfish splittable flows and NP-completeness
- Network flow optimization with minimum quantities
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Ameso optimization: a relaxation of discrete midpoint convexity
- The complexity of approximating a nonlinear program
- Mean‐standard deviation model for minimum cost flow problem
- Constrained state estimation for stochastic jump systems: moving horizon approach
- A faster algorithm for the resource allocation problem with convex cost functions
- Title not available (Why is that?)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Resource allocation problems with expensive function evaluations
- Complexity results for some global optimization problems
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- Nonlinear phenomena in spaces of algorithms
- Algorithmic problems of nontransitive (SSB) utilities
- Complexity and algorithms for convex network optimization and other nonlinear problems
- Decreasing minimization on M-convex sets: background and structures
- A heuristic method for the supplier selection and order quantity allocation problem
- A complex-valued gradient flow for the entangled bipartite low rank approximation
- Title not available (Why is that?)
- Decreasing minimization on M-convex sets: algorithms and applications
- Optimal procurement and production planning for multi-product multi-stage production under yield uncertainty
- Title not available (Why is that?)
This page was built for publication: Complexity and algorithms for nonlinear optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480263)
