Výsledky vyhledávání - (abstrakty OR abstracts) computational complexity for mathematical programming problems

Accelerated gradient methods on the Grassmann and Stiefel manifolds

Autoři: Xiaojing Zhu

Zdroj: Japan Journal of Industrial and Applied Mathematics. 42:751-786

Témata: Programming in abstract spaces, Stiefel manifold, Numerical mathematical programming methods, Nonlinear programming, accelerated gradient, global rate of convergence, Riemannian optimization, Abstract computational complexity for mathematical programming problems, Nonconvex programming, global optimization, Grassmann manifold

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/8037191
https://doi.org/10.1007/s13160-025-00692-8

a complexity analysis of a smoothing method using chks functions for monotone linear complementarity problems: A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems

Autoři: Keisuke Hotta Masatora Inaba Akiko Yoshise

Zdroj: Computational Optimization and Applications. 17(2):183-201

Témata: complexity bound, Interior-point methods, Variational inequalities, Abstract computational complexity for mathematical programming problems, linear complementarity problem, monotonicity, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), smoothing method

Popis souboru: application/xml

On the complexity of the path-following method for a tracking problem governed by parabolic equations

Autoři: Oliveira, Miguel Smirnov, Georgi Universidade do Minho

Přispěvatelé: Oliveira, Miguel Smirnov, Georgi Universidade do Minho

Témata: Complexity bounds, Convex programming, Discrete approximations in optimal control, heat equation, Heat equation, complexity bounds, Tracking problem, Abstract computational complexity for mathematical programming problems, convex programming, tracking problem

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://zbmath.org/6594199
https://hdl.handle.net/1822/42807

Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization

Autoři: Frank E. Curtis Michael J. O’Neill Daniel P. Robinson

Zdroj: Mathematical Programming. 205:431-483

Témata: Analysis of algorithms and problem complexity, 0211 other engineering and technologies, Stochastic programming, 02 engineering and technology, stochastic optimization, nonlinear optimization, sequential quadratic optimization, worst-case complexity, 49M37, 65K05, 65K10, 90C15, 90C30, 90C55, Methods of successive quadratic programming type, Complexity and performance of numerical algorithms, Numerical mathematical programming methods, Nonlinear programming, Optimization and Control (math.OC), FOS: Mathematics, Analysis of algorithms, Abstract computational complexity for mathematical programming problems, Mathematics - Optimization and Control

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/2112.14799
https://zbmath.org/7829609
https://doi.org/10.1007/s10107-023-01981-1

spherical minimax location problem: Spherical minimax location problem

Autoři: P. Das N. R. Chakraborti P. K. Chaudhuri

Zdroj: Computational Optimization and Applications. 18(3):311-326

Témata: minimax location, Discrete location and assignment, algorithm, geodesic norm, Programming involving graphs or networks, Abstract computational complexity for mathematical programming problems, Minimax problems in mathematical programming

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/article/10.1023/A%3A1011248622793

Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions

Autoři: Takashi Tsuchiya Renato D. C. Monteiro

Zdroj: Mathematical Programming. 84:39-53

Témata: Convex programming, polynomial complexity, 0211 other engineering and technologies, Interior-point methods, 02 engineering and technology, semidefinite programming, path-following methods, Numerical mathematical programming methods, interior-point methods, Semidefinite programming, Optimality conditions and duality in mathematical programming, Abstract computational complexity for mathematical programming problems, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), primal-dual methods

Popis souboru: application/xml

Přístupová URL adresa: https://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/61438/1/1004-8.pdf
https://zbmath.org/1372699
https://repository.kulib.kyoto-u.ac.jp/dspace/handle/2433/61438
https://www2.isye.gatech.edu/~monteiro/publications/tech_reports/ksh.pdf
https://link.springer.com/article/10.1007/s10107980021a
http://ci.nii.ac.jp/naid/110003483674
https://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/61438/1/1004-8.pdf
https://dblp.uni-trier.de/db/journals/mp/mp84.html#MonteiroT99

complexity of one cycle robotic flow shops: Complexity of one-cycle robotic flow-shops

Autoři: Nadia Brauner Gerd Finke Wieslaw Kubiak

Zdroj: Journal of Scheduling. 6(4):355-371

Témata: TSP problem, Deterministic scheduling theory in operations research, robotic cells, Programming involving graphs or networks, Abstract computational complexity for mathematical programming problems

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1968830
https://doi.org/10.1023/a:1024008726557
https://link.springer.com/article/10.1023/A:1024008726557
https://dblp.uni-trier.de/db/journals/scheduling/scheduling6.html#BraunerFK03
https://doi.org/10.1023/A:1024008726557
http://dblp.uni-trier.de/db/journals/scheduling/scheduling6.html#BraunerFK03

a polynomial cutting surfaces algorithm for the convexfeasibility problem defined by self concordant inequalities: A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities

Autoři: Luo, Z.-Q. Sun, J. DECISION SCIENCES

Přispěvatelé: Luo, Z.-Q. Sun, J. DECISION SCIENCES

Zdroj: Computational Optimization and Applications. 15(2):167-191

Témata: Convex programming, convex feasibility problem, column generation, potential reduction, Polyhedral combinatorics, branch-and-bound, branch-and-cut, analytic center, Abstract computational complexity for mathematical programming problems

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1460613
https://doi.org/10.1023/a:1008787027641
https://link.springer.com/article/10.1023/A:1008787027641
https://experts.umn.edu/en/publications/polynomial-cutting-surfaces-algorithm-for-the-convex-feasibility-

a set of greedy randomized adaptive local search procedure grasp implementations for the multidimensional assignment problem: A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem

Autoři: Alexander J. Robertson

Zdroj: Computational Optimization and Applications. 19(2):145-164

Témata: Combinatorial optimization, GRASP, discrete optimization, assignment problem, Abstract computational complexity for mathematical programming problems, NP-complete

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/article/10.1023/A:1011285402433
https://link.springer.com/content/pdf/10.1023/A:1011285402433.pdf

Strongly Convergent Inertial Proximal Point Algorithm Without On-line Rule: Strongly convergent inertial proximal point algorithm without on-line rule

Autoři: Jolaoso, Lateef O. Shehu, Yekini Yao, Jen-Chih

Zdroj: Journal of Optimization Theory and Applications. 200:555-584

Témata: strong convergence, Hilbert spaces, Convex programming, Discrete approximations in optimal control, Nonlinear programming, Analysis of algorithms and problem complexity, Semidefinite programming, maximal monotone operators, two-point inertia, Abstract computational complexity for mathematical programming problems, proximal point algorithm

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/7802200
https://doi.org/10.1007/s10957-023-02355-5

a constant potential infeasible start interior point algorithmwith computational experiments and applications: A constant-potential infeasible-start interior-point algorithm with computational experiments and applications

Autoři: Levent Tunçel Abbas Seifi

Zdroj: Computational Optimization and Applications. 9(2):107-152

Témata: polynomial complexity, potential function, constant-potential infeasible-start interior-point, Linear programming, large scale planning, Stochastic programming, simple recourse, worst-case iteration complexity analysis, Abstract computational complexity for mathematical programming problems

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1139624
https://doi.org/10.1023/a:1018343420495
https://dblp.uni-trier.de/db/journals/coap/coap9.html#SeifiT98
https://link.springer.com/article/10.1023/A:1018343420495
https://link.springer.com/content/pdf/10.1023/A:1018343420495.pdf
https://dl.acm.org/doi/10.1023/A%3A1018343420495

the approximability behaviour of some combinatorial problems with respectto the approximability of a class of maximum independent set problems: The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems

Autoři: Demange, Marc Paschos, Vangelis Université Paris 1 a další

Přispěvatelé: Demange, Marc Paschos, Vangelis Université Paris 1 a další

Zdroj: Computational Optimization and Applications. 7(3):307-324

Témata: Convex programming, Combinatorial optimization, polynomial time approximation algorithm, quadratic programming, Programming involving graphs or networks, Quadratic programming, independent set, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), NP-complete problem, vertex covering, quadratic programming as subproblem, polynomial time \(\rho\)-approximation algorithm, Abstract computational complexity for mathematical programming problems, Recherche opérationnelle

Popis souboru: application/xml

Přístupová URL adresa: https://basepub.dauphine.fr/handle/123456789/2774
https://rd.springer.com/article/10.1023/A%3A1008660812834
https://dblp.uni-trier.de/db/journals/coap/coap7.html#DemangeP97
https://link.springer.com/article/10.1023%2FA%3A1008660812834

Computational investigations of maximum flow algorithms

Autoři: James B. Orlin Ajay K. Mishra Ravindra K. Ahuja a další

Zdroj: European Journal of Operational Research. 97:509-542

Témata: capacity-scaling algorithm, preflow-push algorithms, Deterministic network models in operations research, Programming involving graphs or networks, augmenting path algorithms, Abstract computational complexity for mathematical programming problems, computational comparisons, maximum flow

Popis souboru: application/xml

Přístupová URL adresa: https://dspace.mit.edu/bitstream/1721.1/2573/1/SWP-3811-32867587.pdf
https://zbmath.org/1253183
https://doi.org/10.1016/s0377-2217(96)00269-x
https://www.sciencedirect.com/science/article/pii/S037722179600269X
https://www.sciencedirect.com/science/article/pii/S037722179600269X#!
http://dspace.mit.edu/handle/1721.1/2573?show=full
https://econpapers.repec.org/article/eeeejores/v_3a97_3ay_3a1997_3ai_3a3_3ap_3a509-542.htm
https://ideas.repec.org/a/eee/ejores/v97y1997i3p509-542.html

On the complexity of recognizing integrality and total dual integrality of the {0,1/2}-closure: On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure

Autoři: Matthias Brugger Andreas S. Schulz

Zdroj: Operations Research Letters. 50:16-19

Témata: FOS: Computer and information sciences, computational complexity, Discrete Mathematics (cs.DM), integrality, \(\{0, 1 / 2 \}\)-cuts, 0211 other engineering and technologies, Integer programming, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Optimization and Control (math.OC), Gomory-chvátal cuts, Polyhedral combinatorics, branch-and-bound, branch-and-cut, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Abstract computational complexity for mathematical programming problems, Mathematics - Optimization and Control, total dual integrality, Computer Science - Discrete Mathematics

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/pdf/2104.14486
http://arxiv.org/abs/2104.14486
https://arxiv.org/pdf/2104.14486
https://arxiv.org/abs/2104.14486
https://dblp.uni-trier.de/db/journals/corr/corr2104.html#abs-2104-14486
https://www.sciencedirect.com/science/article/pii/S0167637721001693

The Complexity of Generic Primal Algorithms for Solving General Integer Programs

Autoři: Schulz, Andreas S. Weismantel, Robert

Zdroj: Mathematics of Operations Research, 2002 Nov 01. 27(4), 681-692.

Přístupová URL adresa: https://www.jstor.org/stable/3690461

On polynomial solvability of the high multiplicity total weighted tardiness problem

Autoři: Jadranka Skorin-Kapov Frieda Granot

Zdroj: Discrete Applied Mathematics. 41:139-146

Témata: integer quadratic nonseparable transportation, Deterministic scheduling theory in operations research, single machine, total weighted tardiness, Applied Mathematics, 0211 other engineering and technologies, Discrete Mathematics and Combinatorics, 0102 computer and information sciences, 02 engineering and technology, Quadratic programming, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.), Abstract computational complexity for mathematical programming problems, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://www.sciencedirect.com/science/article/abs/pii/0166218X9390034L
https://www.sciencedirect.com/science/article/pii/0166218X9390034L
https://doi.org/10.1016/0166-218X(93)90034-L
https://dblp.uni-trier.de/db/journals/dam/dam41.html#GranotS93

The complexity of two-person zero-sum games in extensive form

Autoři: Nimrod Megiddo Daphne Koller

Zdroj: Games and Economic Behavior. 4:528-552

Témata: extensive form, 0502 economics and business, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, finite two-person zero-sum games, complexity of finding max-min strategies, 2-person games

Popis souboru: application/xml

Přístupová URL adresa: http://theory.stanford.edu/%7Emegiddo/pdf/recall.pdf
https://zbmath.org/85740
https://doi.org/10.1016/0899-8256(92)90035-q
https://www.sciencedirect.com/science/article/pii/089982569290035Q
https://ideas.repec.org/a/eee/gamebe/v4y1992i4p528-552.html
https://econpapers.repec.org/RePEc:eee:gamebe:v:4:y:1992:i:4:p:528-552
http://www.sciencedirect.com/science/article/pii/089982569290035Q

extremal properties of sums of binomial coefficients: Extremal properties of sums of binomial coefficients

Autoři: N. N. Kanaeva O. A. Shcherbina

Zdroj: Journal of Mathematical Sciences. 107(6):4485-4490

Témata: extremal properties, majorization theory, binomial coefficients, discrete optimization, Programming involving graphs or networks, Abstract computational complexity for mathematical programming problems, algorithms, Factorials, binomial coefficients, combinatorial functions

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1681781
https://link.springer.com/article/10.1023/A:1012537407986

gauss quadrature applied to trust region computations: Gauss quadrature applied to trust region computations

Autoři: Daniela Calvetti Lothar Reichel

Zdroj: Numerical Algorithms. 34(1):85-102

Témata: Large-scale problems in mathematical programming, large scale problem, numerical examples, Numerical mathematical programming methods, trust-region method, upper and lower bounds, quasi-Newton method, Lanczos process, Methods of quasi-Newton type, Abstract computational complexity for mathematical programming problems, local minimizer

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2005329
https://doi.org/10.1023/a:1026130310913
https://dblp.uni-trier.de/db/journals/na/na34.html#CalvettiR03
https://ui.adsabs.harvard.edu/abs/2003NuAlg..34...85C/abstract
https://link.springer.com/article/10.1023/A:1026130310913

a note on the approximation of a minimum weight maximal independent set: A note on the approximation of a minimum-weight maximal independent set

Autoři: Marc Demange

Zdroj: Computational Optimization and Applications. 14(1):157-169

Témata: independent set, computational complexity, combinatorial problem, Programming involving graphs or networks, Abstract computational complexity for mathematical programming problems, polynomial-time approximation algorithms

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1339082
https://doi.org/10.1023/a:1008765214400