The software contains some functions and drivers for solving LP problems of the form min c’x s.t Ax=b; x>=0 by a large neihghborhood infeasible predictor_corrector algorithm. It is based on Newton steps on the perturbed optimality system x.*s = m * 1 Ax = b c + A’lambda = s x>= 0 , s>=0 m-->0 The matrix A may be either full or sparse; computations are made accordingly. This is a software based on either SCILAB or matlab for solving large scale linear programming problems. It can be freely used for non commercial use.

References in zbMATH (referenced in 196 articles , 1 standard article )

Showing results 1 to 20 of 196.
Sorted by year (citations)

1 2 3 ... 8 9 10 next

  1. Almeida Guimarães, Dilson; Salles da Cunha, Alexandre; Pereira, Dilson Lucas: Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (2020)
  2. Barbarosie, Cristian; Toader, Anca-Maria; Lopes, Sérgio: A gradient-type algorithm for constrained optimization with application to microstructure optimization (2020)
  3. Chrétien, Stéphane; Clarkson, Paul: A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids (2020)
  4. Deng, Hao; Hinnebusch, Shawn; To, Albert C.: Topology optimization design of stretchable metamaterials with Bézier skeleton explicit density (BSED) representation algorithm (2020)
  5. Gdawiec, Krzysztof; Shahid, Abdul Aziz; Nazeer, Waqas: Higher order methods of the basic family of iterations via (S)-iteration scheme with (s)-convexity (2020)
  6. Hare, Warren; Planiden, Chayne; Sagastizábal, Claudia: A derivative-free (\mathcalV\mathcalU)-algorithm for convex finite-max problems (2020)
  7. Helou, Elias S.; Santos, Sandra A.; Simões, Lucas E. A.: A new sequential optimality condition for constrained nonsmooth optimization (2020)
  8. Luna, Juan Pablo; Sagastizábal, Claudia; Solodov, Mikhail: A class of Benders decomposition methods for variational inequalities (2020)
  9. Mitridati, Lesia; Kazempour, Jalal; Pinson, Pierre: Heat and electricity market coordination: a scalable complementarity approach (2020)
  10. Pang, Li-Ping; Wu, Qi; Wang, Jin-He; Wu, Qiong: A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (2020)
  11. Pay, Babak Saleck; Song, Yongjia: Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse (2020)
  12. Tang, Chunming; Liu, Shuai; Jian, Jinbao; Ou, Xiaomei: A multi-step doubly stabilized bundle method for nonsmooth convex optimization (2020)
  13. Theljani, Anis; Chen, Ke: A Nash game based variational model for joint image intensity correction and registration to deal with varying illumination (2020)
  14. Cegielski, Andrzej; Nimana, Nimit: Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour (2019)
  15. de Oliveira, Welington: Proximal bundle methods for nonsmooth DC programming (2019)
  16. Dussault, Jean-Pierre; Frappier, Mathieu; Gilbert, Jean Charles: A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem (2019)
  17. Effio Saldivar, Carolina; Herskovits, José; Luna, Juan Pablo; Sagastizábal, Claudia: Multidimensional calibration of crude oil and refined products via semidefinite programming techniques (2019)
  18. Ellabib, Abdellatif; Ouakrim, Youssef: A vectorized regularization method for multivalued parameters identification (2019)
  19. Ellabib, Abdellatif; Ouakrim, Youssef: Inverse problem for a class of nonlinear elliptic equations with entropy solution (2019)
  20. Erhel, Jocelyne; Migot, Tangi: Characterizations of solutions in geochemistry: existence, uniqueness, and precipitation diagram (2019)

1 2 3 ... 8 9 10 next