PLCP
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.
Keywords for this software
References in zbMATH (referenced in 192 articles , 1 standard article )
Showing results 1 to 20 of 192.
Sorted by year (- 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)
- Barbarosie, Cristian; Toader, Anca-Maria; Lopes, Sérgio: A gradient-type algorithm for constrained optimization with application to microstructure optimization (2020)
- Chrétien, Stéphane; Clarkson, Paul: A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids (2020)
- Gdawiec, Krzysztof; Shahid, Abdul Aziz; Nazeer, Waqas: Higher order methods of the basic family of iterations via (S)-iteration scheme with (s)-convexity (2020)
- Mitridati, Lesia; Kazempour, Jalal; Pinson, Pierre: Heat and electricity market coordination: a scalable complementarity approach (2020)
- 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)
- Pay, Babak Saleck; Song, Yongjia: Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse (2020)
- Tang, Chunming; Liu, Shuai; Jian, Jinbao; Ou, Xiaomei: A multi-step doubly stabilized bundle method for nonsmooth convex optimization (2020)
- Theljani, Anis; Chen, Ke: A Nash game based variational model for joint image intensity correction and registration to deal with varying illumination (2020)
- Cegielski, Andrzej; Nimana, Nimit: Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour (2019)
- de Oliveira, Welington: Proximal bundle methods for nonsmooth DC programming (2019)
- 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)
- Effio Saldivar, Carolina; Herskovits, José; Luna, Juan Pablo; Sagastizábal, Claudia: Multidimensional calibration of crude oil and refined products via semidefinite programming techniques (2019)
- Ellabib, Abdellatif; Ouakrim, Youssef: A vectorized regularization method for multivalued parameters identification (2019)
- Ellabib, Abdellatif; Ouakrim, Youssef: Inverse problem for a class of nonlinear elliptic equations with entropy solution (2019)
- Erhel, Jocelyne; Migot, Tangi: Characterizations of solutions in geochemistry: existence, uniqueness, and precipitation diagram (2019)
- Gharbia, I. Ben; Gilbert, J. Ch.: An algorithmic characterization of P-matricity. II: Adjustments, refinements, and validation (2019)
- Grimm, Veronika; Kleinert, Thomas; Liers, Frauke; Schmidt, Martin; Zöttl, Gregor: Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (2019)
- Kleinert, Thomas; Schmidt, Martin: Global optimization of multilevel electricity market models including network design and graph partitioning (2019)
- Lage, Clara; Sagastizábal, Claudia; Solodov, Mikhail: Multiplier stabilization applied to two-stage stochastic programs (2019)