Suchergebnisse - (abstract OR abstraktu) computational complexity for mathematical programming problems*

Accelerated gradient methods on the Grassmann and Stiefel manifolds

Autoren: Xiaojing Zhu

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: 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

Autoren: Keisuke Hotta Masatora Inaba Akiko Yoshise

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

Schlagwörter: 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

Dateibeschreibung: application/xml

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

Autoren: Frank E. Curtis Michael J. O’Neill Daniel P. Robinson

Quelle: Mathematical Programming. 205:431-483

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2112.14799
https://zbmath.org/7829609
https://doi.org/10.1007/s10107-023-01981-1

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

Autoren: Takashi Tsuchiya Renato D. C. Monteiro

Quelle: Mathematical Programming. 84:39-53

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: 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

Autoren: Nadia Brauner Gerd Finke Wieslaw Kubiak

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

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

Dateibeschreibung: application/xml

Zugangs-URL: 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 constant potential infeasible start interior point algorithmwith computational experiments and applications: A constant-potential infeasible-start interior-point algorithm with computational experiments and applications

Autoren: Levent Tunçel Abbas Seifi

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: 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

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

Autoren: Jolaoso, Lateef O. Shehu, Yekini Yao, Jen-Chih

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/7802200
https://doi.org/10.1007/s10957-023-02355-5

Computational investigations of maximum flow algorithms

Autoren: James B. Orlin Ajay K. Mishra Ravindra K. Ahuja et al.

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: 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

Autoren: Matthias Brugger Andreas S. Schulz

Quelle: Operations Research Letters. 50:16-19

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: 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

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

Autoren: Oliveira, Miguel Smirnov, Georgi Universidade do Minho

Weitere Verfasser: Oliveira, Miguel Smirnov, Georgi Universidade do Minho

Schlagwörter: 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

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://zbmath.org/6594199
https://hdl.handle.net/1822/42807

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

Autoren: N. N. Kanaeva O. A. Shcherbina

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1681781
https://link.springer.com/article/10.1023/A:1012537407986

spherical minimax location problem: Spherical minimax location problem

Autoren: P. Das N. R. Chakraborti P. K. Chaudhuri

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/article/10.1023/A%3A1011248622793

The time complexity of RAC sort in mathematical programming: a real-valued array well-ordering method of worst-case time complexity \(O(n)\)

Autoren: Nakagawa, Yuji

Schlagwörter: Abstract computational complexity for mathematical programming problems

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1398014

ssvm a smooth support vector machine for classification: SSVM: A smooth support vector machine for classification

Autoren: Olvi L. Mangasarian Yuh-Jye Lee

Quelle: Computational Optimization and Applications. 20(1):5-22

Schlagwörter: classification, Newton-Armijo algorithm, Nonlinear programming, Learning and adaptive systems in artificial intelligence, smoothing, Abstract computational complexity for mathematical programming problems, support vector machines

Dateibeschreibung: application/xml

Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models: Stochastic trust-region methods with trust-region radius depending on probabilistic models

Autoren: Wang, Xiaoyu Yuan, Yaxiang

Quelle: Journal of Computational Mathematics. 40:294-334

Schlagwörter: Numerical optimization and variational techniques, probabilistic models, Stochastic optimization, 0211 other engineering and technologies, 02 engineering and technology, stochastic optimization, Global convergence, trust-region methods, global convergence, trust-region radius, Numerical mathematical programming methods, Optimization and Control (math.OC), Trust-region methods, Trust- region radius, FOS: Mathematics, Probabilistic models, Abstract computational complexity for mathematical programming problems, Mathematics - Optimization and Control, 65K05, 65K10, 90C60

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/pdf/1904.03342
http://arxiv.org/abs/1904.03342

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

Autoren: Alexander J. Robertson

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

Schlagwörter: Combinatorial optimization, GRASP, discrete optimization, assignment problem, Abstract computational complexity for mathematical programming problems, NP-complete

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/article/10.1023/A:1011285402433
https://link.springer.com/content/pdf/10.1023/A:1011285402433.pdf

Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity

Autoren: Chengxian Xu Shanglu He

Quelle: Science in China Series A: Mathematics. 44:338-344

Schlagwörter: polynomial-time complexity, uniform \(P\)-function, infeasible-interior-point algorithm, 0211 other engineering and technologies, complementarity problem, Interior-point methods, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1782091
https://doi.org/10.1007/bf02878714
https://link.springer.com/content/pdf/10.1007/BF02878714.pdf
https://link.springer.com/article/10.1007/BF02878714
https://ui.adsabs.harvard.edu/abs/2001ScChA..44..338H/abstract

chains and trees strong weak order in job scheduling: Chains and trees: `Strong' -- `weak' order in job scheduling

Autoren: Moshe Dror

Quelle: Order. 14(3):211-228

Schlagwörter: Partial orders, general, Deterministic scheduling theory in operations research, Analysis of algorithms and problem complexity, NP-hardness, strong-weak precedence distinction, polynomial time solvability, Abstract computational complexity for mathematical programming problems

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1210053
https://doi.org/10.1023/a:1006014810928
https://arizona.pure.elsevier.com/en/publications/chains-and-trees-strong-weak-order-in-job-scheduling
https://link.springer.com/content/pdf/10.1023/A:1006014810928.pdf
https://link.springer.com/article/10.1023/A%3A1006014810928

Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints: Computational complexity of some maximum average weight problems with precedence constraints

Autoren: Ulrich Faigle Walter Kern

Quelle: Operations Research. 42:688-693

Schlagwörter: learning, tree-structured attributes, 0211 other engineering and technologies, Integer programming, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, Abstract computational complexity for mathematical programming problems, 01 natural sciences, maximum average weight, NP-complete

Dateibeschreibung: application/xml

Zugangs-URL: https://ris.utwente.nl/ws/files/6852520/Faigle94computational.pdf
https://zbmath.org/710922
https://doi.org/10.1287/opre.42.4.688
https://research.utwente.nl/en/publications/fcb5a027-eca4-46df-9ece-52f60505272b
https://doi.org/10.1287/opre.42.4.688

On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems: On the complexity of determining tolerances for \(\varepsilon\)-optimal solutions to min-max combinatorial optimization problems

Autoren: Ghosh, Diptesh Sierksma, G.

Quelle: Applicationes Mathematicae. 30:305-313

Schlagwörter: Combinatorial optimization, Epsilon-Optimal Solutions, Tolerances, min-max, 01 natural sciences, sensitivity analysis, Optimaliseren, 31.12, Sensitivity, stability, parametric optimization, 0101 mathematics, Combinatieleer, Abstract computational complexity for mathematical programming problems, complexity, 0-1 combinatorial optimization problems

Dateibeschreibung: application/xml

Zugangs-URL: https://www.impan.pl/shop/publication/transaction/download/product/84031?download.pdf
https://zbmath.org/2120086
https://doi.org/10.4064/am30-3-5
https://research.rug.nl/en/publications/ffc140bc-5c73-4110-a7aa-b1eaa49742a1
https://hdl.handle.net/11370/ffc140bc-5c73-4110-a7aa-b1eaa49742a1
https://research.rug.nl/en/publications/04d94fad-a3bb-4c7a-ba39-5ca594fe8369
https://hdl.handle.net/11370/04d94fad-a3bb-4c7a-ba39-5ca594fe8369
https://pure.rug.nl/ws/files/3129277/00a35.pdf
https://research.rug.nl/en/publications/on-the-complexity-of-determining-tolerances-for-e-optimal-solutio
https://www.rug.nl/research/portal/publications/on-the-complexity-of-determining-tolerances-for-eoptimal-solutions-to-minmax-combinatorial-optimization-problems(ffc140bc-5c73-4110-a7aa-b1eaa49742a1)/export.html
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.bwnjournal-article-doi-10_4064-am30-3-5
https://dialnet.unirioja.es/servlet/articulo?codigo=3450443
https://www.impan.pl/pl/wydawnictwa/czasopisma-i-serie-wydawnicze/applicationes-mathematicae/all/30/3/84031/on-the-complexity-of-determining-tolerances-for-varepsilon-optimal-solutions-to-min-max-combinatorial-optimization-problems
http://irs.ub.rug.nl/ppn/240570340